Transformation Semigroups and Order-Preserving Mappings

Transformation semigroups constitute a fundamental class of algebraic structures formed by the set of all functions from a given set into itself, equipped with composition as the binary operation. These semigroups provide a unifying framework for studying symmetry, combinatorial enumeration and dynamical systems. Within this broad context, order-preserving mappings arise when the underlying set is endowed with a partial or total order and one restricts attention to those functions that maintain the order relation. The resulting monoids of order‐preserving transformations encapsulate both rich algebraic properties—such as regularity, inverses and idempotents—and intricate combinatorial features, including enumeration of orbits and collapse measures. Key structural tools for their analysis include Green’s relations, which partition elements according to ideal‐theoretic behaviour, and notions of regularity and abundance, which characterise the solvability of certain equations within the semigroup. These concepts find applications across theoretical computer science, particularly in automata theory and sorting networks, as well as in combinatorial design, where knowledge of endomorphism monoids informs the classification of graphs and posets. Recent advances have deepened our understanding of how restrictions—such as preserving an equivalence relation or partial order‐embedding—shape both the algebraic hierarchy and the combinatorial hierarchy of these semigroups.

Research from Nature Portfolio

No recent Nature Portfolio content available.

Transformation Semigroups and Order-Preserving Mappings publication trend

The graph below shows the total number of articles in transformation semigroups and order-preserving mappings across all publications each year (not limited to Nature Index journals).

Technical terms

Semigroup: A set equipped with an associative binary operation.

Transformation semigroup: The semigroup of all self‐maps on a set under composition.

Order‐preserving mapping: A function on a poset that maintains the given order relation.

Green’s relations: Five equivalence relations on a semigroup (ℒ, ℛ, 𝒥, 𝒟, ℋ) describing its ideal and factorisation structure.

Regular element: An element s for which there exists t with s = s t s, indicating a form of internal invertibility.

References

1. Regularity and abundance on semigroups of transformations preserving an equivalence relation on an invariant set. AIMS Mathematics (2023).
2. Combinatorial results of collapse for order-preserving and order-decreasing transformations. Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics (2022).
3. On pomonoid of partial transformations of a poset. Open Mathematics (2023).