Filtern
Volltext vorhanden
- nein (9)
Dokumenttyp
Sprache
- Englisch (9)
Gehört zur Bibliographie
- ja (9)
Schlagworte
- relative rank (3)
- Maximal subsemigroups (2)
- Order-preserving transformations (2)
- generators (2)
- transformations (2)
- Extensive transformation (1)
- Finite transformation semigroup (1)
- Green´s Relations (1)
- Infinite chain (1)
- Maximal subsemibands (1)
- Order-reversing transformations (1)
- Rank (1)
- Regular semigroups (1)
- Transformation semigroup (1)
- Transformation semigroups (1)
- Transformation semigroups on infinite chains (1)
- endomorphism semigroup (1)
- fence-preserving transformations (1)
- finite transformation semigroup (1)
- inverse semigroup (1)
- maximal subsemigroups (1)
- order-preserving (1)
- orientation-preserving (1)
- orientation-preserving and orientation-reversing transformations (1)
- orientation-preserving transformations (1)
- rank (1)
- restricted range (1)
- semigroups on infinite chain (1)
- transformation (1)
Institut
The study of the semigroups OPn, of all orientation-preserving transformations on an n-element chain, and ORn, of all orientation-preserving or orientation-reversing transformations on an n-element chain, has began in [17] and [5]. In order to bring more insight into the subsemigroup structure of OPn and ORn, we characterize their maximal subsemigroups.
For n∈N , let Xn={a1,a2,…,an} be an n-element set and let F=(Xn;<f) be a fence, also called a zigzag poset. As usual, we denote by In the symmetric inverse semigroup on Xn. We say that a transformation α∈In is fence-preserving if x<fy implies that xα<fyα, for all x,y in the domain of α. In this paper, we study the semigroup PFIn of all partial fence-preserving injections of Xn and its subsemigroup IFn={α∈PFIn:α−1∈PFIn}. Clearly, IFn is an inverse semigroup and contains all regular elements of PFIn. We characterize the Green’s relations for the semigroup IFn. Further, we prove that the semigroup IFn is generated by its elements with rank ≥n−2. Moreover, for n∈2N, we find the least generating set and calculate the rank of IFn.
A partial transformation alpha on an n-element chain X-n is called order-preserving if x <= y implies x alpha <= y alpha for all x, y in the domain of alpha and it is called extensive if x <= x alpha for all x in the domain of alpha. The set of all partial order-preserving extensive transformations on X-n forms a semiband POEn. We determine the maximal subsemigroups as well as the maximal subsemibands of POEn.
A semigroup S is called anti-inverse if for all a E S there is a b is an element of S such that aba = b and bab = a. Each anti-inverse semigroup is regular. In the present paper, we study anti-inverse subsemigroups within the semigroup T-n of all transformations on an n-element set (1 <= n is an element of N). In particular, we characterize all anti-inverse semigroups within the J-classes of T-n and illustrate our result by four examples.
Let X be an infinite linearly ordered set and let Y be a nonempty subset of X. We calculate the relative rank of the semigroup OP(X,Y) of all orientation-preserving transformations on X with restricted range Y modulo the semigroup O(X,Y) of all order-preserving transformations on X with restricted range Y. For Y = X, we characterize the relative generating sets of minimal size.
In this note, we consider the semigroup O(X) of all order endomorphisms of an infinite chain X and the subset J of O(X) of all transformations alpha such that vertical bar Im(alpha)vertical bar = vertical bar X vertical bar. For an infinite countable chain X, we give a necessary and sufficient condition on X for O(X) = < J > to hold. We also present a sufficient condition on X for O(X) = < J > to hold, for an arbitrary infinite chain X.