On inverse subsemigroups of the semigroup of orientation-preserving or orientation-reversing transformations
نویسندگان
چکیده
It is well-known [16] that the semigroup Tn of all total transformations of a given n-element set Xn is covered by its inverse subsemigroups. This note provides a short and direct proof, based on properties of digraphs of transformations, that every inverse subsemigroup of order-preserving transformations on a finite chain Xn is a semilattice of idempotents, and so the semigroup of all order-preserving transformations of Xn is not covered by its inverse subsemigroups. This result is used to show that the semigroup of all orientation-preserving transformations and the semigroup of all orientation-preserving or orientation-reversing transformations of the chain Xn are covered by their inverse subsemigroups precisely when n 6 3.
منابع مشابه
Combinatorial Results for Semigroups of Orientation-Preserving Partial Transformations
Let Xn = {1, 2, . . . , n}. On a partial transformation α : Domα ⊆ Xn → Im α ⊆ Xn of Xn the following parameters are defined: the breadth or width of α is | Dom α |, the height of α is | Im α |, and the right (resp., left) waist of α is max(Im α) (resp., min(Im α)). We compute the cardinalities of some equivalences defined by equalities of these parameters on OPn, the semigroup of orientation-p...
متن کاملAbelian kernels of monoids of order-preserving maps and of some of its extensions
We compute the abelian kernels of some monoids of partial transformations. More precisely, the cases of the symmetric inverse monoid, monoids of order-preserving or order-reversing transformations, so as monoids of orientation-preserving or orientationreversing transformations are treated.
متن کاملOn classification of maximal nilpotent subsemigroups
We develop a general approach to the study of maximal nilpotent subsemigroups of finite semigroups. This approach can be used to recover many known classifications of maximal nilpotent subsemigroups, in particular, for the symmetric inverse semigroup, the symmetric semigroup, and the factor power of the symmetric group. We also apply this approach to obtain a classification of maximal nilpotent...
متن کاملInverse subsemigroups of the monogenic free inverse semigroup
It is shown that every finitely generated inverse subsemigroup (submonoid) of the monogenic free inverse semigroup (monoid) is finitely presented. As a consequence, the homomorphism and the isomorphism problems for the monogenic free inverse semigroup (monoid) are proved to be decidable.
متن کاملOn the lattice of full eventually regular subsemigroups
We generalize to eventually regular (or ‘π-regular’) semigroups the study of the lattice of full regular subsemigroups of a regular semigroup, which has its most complete exposition in the case of inverse semigroups. By means of a judicious definition, it is shown that the full eventually regular subsemigroups of such a semigroup form a complete lattice LF , which projects onto the lattices of ...
متن کامل