Refine
Year of publication
Document Type
- Article (38)
- Doctoral Thesis (2)
- Monograph/Edited Volume (1)
- Postprint (1)
- Preprint (1)
Is part of the Bibliography
- yes (43)
Keywords
- Transformation semigroups (3)
- relative rank (3)
- Bruck-Reilly extension (2)
- Maximal subsemigroups (2)
- Order-preserving transformations (2)
- generators (2)
- maximal subsemigroups (2)
- regular monoid (2)
- restricted range (2)
- transformations (2)
- Extensive transformation (1)
- Fence (1)
- Finite transformation semigroup (1)
- Green´s Relations (1)
- Idempotents (1)
- Identities (1)
- Infinite chain (1)
- Maximal subsemibands (1)
- Order-preserving (1)
- Order-preserving maps (1)
- Order-reversing transformations (1)
- Rank (1)
- Rank of semigroup (1)
- Regular semigroups (1)
- Transformation semigroup (1)
- Transformation semigroups on infinite chains (1)
- Zig-zag order (1)
- alternative variety (1)
- category equivalence of clones (1)
- clifford semigroup (1)
- clone of operations (1)
- coloration of terms (1)
- colored solid varieties (1)
- composition of terms (1)
- endomorphism semigroup (1)
- essential position in terms (1)
- fence-preserving transformations (1)
- finite transformation semigroup (1)
- generalized Bruck-Reilly *-extension (1)
- generalized Bruck-Reilly ∗-extension (1)
- generating sets (1)
- inverse semigroup (1)
- maximal subsemigroup (1)
- multi-hypersubstitutions (1)
- normal band (1)
- order-preserving (1)
- order-preserving mappings (1)
- orientation-preserving (1)
- orientation-preserving and orientation-reversing transformations (1)
- orientation-preserving transformations (1)
- orthogroup (1)
- pi-inverse monoid (1)
- rank (1)
- relative ranks (1)
- semigroups on infinite chain (1)
- stable variety (1)
- strong semilattice of semigroups (1)
- transformation (1)
- transformation semigroups (1)
- transformations on infinite set (1)
- π -inverse monoid (1)
Institute
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 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.
Hypersubstitutions are mappings which map operation symbols to terms. Terms can be visualized by trees. Hypersubstitutions can be extended to mappings defined on sets of trees. The nodes of the trees, describing terms, are labelled by operation symbols and by colors, i.e. certain positive integers. We are interested in mappings which map differently-colored operation symbols to different terms. In this paper we extend the theory of hypersubstitutions and solid varieties to multi-hypersubstitutions and colored solid varieties. We develop the interconnections between such colored terms and multihypersubstitutions and the equational theory of Universal Algebra. The collection of all varieties of a given type forms a complete lattice which is very complex and difficult to study; multi-hypersubstitutions and colored solid varieties offer a new method to study complete sublattices of this lattice.