The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems

Author(s):  
D T Huynh
2011 ◽  
Vol 12 (3) ◽  
pp. 279-288
Author(s):  
Shuang WANG ◽  
Guoqing CHAI ◽  
Changsong HU

1995 ◽  
Vol 60 (5) ◽  
pp. 856-862
Author(s):  
Gejza Suchár ◽  
Ivan Danihel

Dipole moments of a series of para-substituted N-phenylsulfonyl-N'-allylthioureas were determined. Comparison of the experimentally found dipole moments with those calculated by vector addition of bond and group moments has shown that (E) conformation at the N-C bonds is preferred. The same result was obtained from the N-H stretching vibrations. The results are compatible with a synperiplanar arrangement at the C-C bond of the allyl moiety.


1981 ◽  
Vol 4 (1) ◽  
pp. 19-34
Author(s):  
Ryszard Danecki

Closure properties of binary ETOL-languages are investigated by means of multiple tree automata. Decidability of the equivalence problem of deterministic binary ETOL-systems is proved.


2011 ◽  
Vol 52 (5) ◽  
pp. 053509 ◽  
Author(s):  
Caroline M. Cochran ◽  
Raymond G. McLenaghan ◽  
Roman G. Smirnov
Keyword(s):  

Entropy ◽  
2021 ◽  
Vol 23 (3) ◽  
pp. 373
Author(s):  
Khaled Abuhmaidan ◽  
Monther Aldwairi ◽  
Benedek Nagy

Vector arithmetic is a base of (coordinate) geometry, physics and various other disciplines. The usual method is based on Cartesian coordinate-system which fits both to continuous plane/space and digital rectangular-grids. The triangular grid is also regular, but it is not a point lattice: it is not closed under vector-addition, which gives a challenge. The points of the triangular grid are represented by zero-sum and one-sum coordinate-triplets keeping the symmetry of the grid and reflecting the orientations of the triangles. This system is expanded to the plane using restrictions like, at least one of the coordinates is an integer and the sum of the three coordinates is in the interval [−1,1]. However, the vector arithmetic is still not straightforward; by purely adding two such vectors the result may not fulfill the above conditions. On the other hand, for various applications of digital grids, e.g., in image processing, cartography and physical simulations, one needs to do vector arithmetic. In this paper, we provide formulae that give the sum, difference and scalar product of vectors of the continuous coordinate system. Our work is essential for applications, e.g., to compute discrete rotations or interpolations of images on the triangular grid.


2006 ◽  
Vol 49 (2) ◽  
pp. 170-184
Author(s):  
Richard Atkins

AbstractThis paper investigates the relationship between a system of differential equations and the underlying geometry associated with it. The geometry of a surface determines shortest paths, or geodesics connecting nearby points, which are defined as the solutions to a pair of second-order differential equations: the Euler–Lagrange equations of the metric. We ask when the converse holds, that is, when solutions to a system of differential equations reveals an underlying geometry. Specifically, when may the solutions to a given pair of second order ordinary differential equations d2y1/dt2 = f (y, ẏ, t) and d2y2/dt2 = g(y, ẏ, t) be reparameterized by t → T(y, t) so as to give locally the geodesics of a Euclidean space? Our approach is based upon Cartan's method of equivalence. In the second part of the paper, the equivalence problem is solved for a generic pair of second order ordinary differential equations of the above form revealing the existence of 24 invariant functions.


2021 ◽  
Author(s):  
Ryszard Mazurek

AbstractFor any commutative semigroup S and positive integer m the power function $$f: S \rightarrow S$$ f : S → S defined by $$f(x) = x^m$$ f ( x ) = x m is an endomorphism of S. We partly solve the Lesokhin–Oman problem of characterizing the commutative semigroups whose all endomorphisms are power functions. Namely, we prove that every endomorphism of a commutative monoid S is a power function if and only if S is a finite cyclic group, and that every endomorphism of a commutative ACCP-semigroup S with an idempotent is a power function if and only if S is a finite cyclic semigroup. Furthermore, we prove that every endomorphism of a nontrivial commutative atomic monoid S with 0, preserving 0 and 1, is a power function if and only if either S is a finite cyclic group with zero adjoined or S is a cyclic nilsemigroup with identity adjoined. We also prove that every endomorphism of a 2-generated commutative semigroup S without idempotents is a power function if and only if S is a subsemigroup of the infinite cyclic semigroup.


Sign in / Sign up

Export Citation Format

Share Document