Refine
Has Fulltext
- no (39) (remove)
Year of publication
Document Type
- Article (36)
- Doctoral Thesis (2)
- Monograph/Edited Volume (1)
Is part of the Bibliography
- yes (39)
Keywords
Institute
- Institut für Mathematik (39) (remove)
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.
A zig-zag (or fence) order is a special partial order on a (finite) set. In this paper, we consider the semigroup TFn of all order-preserving transformations on an n-element zig-zag-ordered set. We determine the rank of TFn and provide a minimal generating set for TFn. Moreover, a formula for the number of idempotents in TFn is given.
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.
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.
Maximal subsemigroups of some semigroups of order-preserving mappings on a countably infinite set
(2017)
In this paper, we study the maximal subsemigroups of several semigroups of order-preserving transformations on the natural numbers and the integers, respectively. We determine all maximal subsemigroups of the monoid of all order-preserving injections on the set of natural numbers as well as on the set of integers. Further, we give all maximal subsemigroups of the monoid of all bijections on the integers. For the monoid of all order-preserving transformations on the natural numbers, we classify also all its maximal subsemigroups, containing a particular set of transformations.
The paper deals with Sigma-composition and Sigma-essential composition of terms which lead to stable and s-stable varieties of algebras. A full description of all stable varieties of semigroups, commutative and idempotent groupoids is obtained. We use an abstract reduction system which simplifies the presentations of terms of type tau - (2) to study the variety of idempotent groupoids and s-stable varieties of groupoids. S-stable varieties are a variation of stable varieties, used to highlight replacement of subterms of a term in a deductive system instead of the usual replacement of variables by terms.
We characterize maximal subsemigroups of the monoid T(X) of all transformations on the set X = a"center dot of natural numbers containing a given subsemigroup W of T(X) such that T(X) is finitely generated over W. This paper gives a contribution to the characterization of maximal subsemigroups on the monoid of all transformations on an infinite set.