# Group Closures of Injective Order-Preserving Transformations

```@article{Catarino2013GroupCO,
title={Group Closures of Injective Order-Preserving Transformations},
author={Paula Catarino and Inessa Levi},
journal={International Journal of Algebra},
year={2013},
volume={7},
pages={703-716}
}```
• Published 2013
• Mathematics
• International Journal of Algebra
Given a group G of permutations of a finite n-element set Xn and a transformation f of Xn, the G-closuref : Gof f is the semigroup generated by all the conjugates of f by permutations in G. A semigroup S of transformations of Xn is G-normal if GS = G, where GS consists of all the permutations h of Xn such that h −1 fh∈ S for all f ∈ S.W e may assume that Xn is a chain and we let POIn be the semigroup of all the partial and total one-to-one order preserving transformations of Xn. In the present…

## References

SHOWING 1-10 OF 22 REFERENCES
Group closures of one-to-one transformations
For a semigroup S of transformations of an infinite set X let G s be the group of all the permutations of X that preserve S under conjugation. Fix a permutation group H on X and a transformation f of
Finite Normal Semigroups
• Mathematics
• 1998
n -element set Xn has only inner automorphisms is investigated. For a semigroup S of transformations of X n, let Gs denote the group of all permutations of Xn that preserve S under conjugation. Fix a
Combinatorial results for semigroups of order-preserving mappings
• P. Higgins
• Mathematics
Mathematical Proceedings of the Cambridge Philosophical Society
• 1993
Consider the finite set Xn = {1,2, …,n} ordered in the standard way. Let Tn denote the full transformation semigroup on Xn, that is, the semigroup of all mappings α: Xn→Xn under composition. We shall
Dn-normal semigroups of transformations
• Mathematics
• 2008
Abstract Given a subgroup G of the symmetric group Sn on n letters, a semigroup S of transformations of Xn is G-normal if GS=G, where GS consists of all permutations h∈Sn such that h−1fh∈S for all
ON THE IDEMPOTENT RANKS OF CERTAIN SEMIGROUPS OF ORDER-PRESERVING TRANSFORMATIONS
• Mathematics
The ranks of the semigroups On, POn and SPOn (the semigroups of order-preserving singular selfmaps, partial and strictly partial transformations on Xn = {1, ..., n} respectively), and the idempotent
Sn-normal semigroups
• Mathematics
• 1994
Certain subsemigroups of the full transformation semigroup Tn on a finite set of cardinality n are investigated, namely those subsemigroups S of Tn, which are normalised by the symmetric group on n
On the inner automorphisms of finite transformation semigroups
• I. Levi
• Mathematics
Proceedings of the Edinburgh Mathematical Society
• 1996
If the group of inner automorphisms of a semigroup S of transformations of a finite n-element set contains an isomorphic copy of the alternating group Altn, then S is an Sn-normal semigroup and all
CONGRUENCES ON MONOIDS OF ORDER-PRESERVING OR ORDER-REVERSING TRANSFORMATIONS ON A FINITE CHAIN
• Mathematics
Glasgow Mathematical Journal
• 2005
This paper is mainly dedicated to describing the congruences on certain monoids of transformations on a finite chain \$X_n\$ with \$n\$ elements. Namely, we consider the monoids \$\od_n\$ and \$\mpod_n\$ of
The Monoid of All Injective Order Preserving Partial Transformations on a Finite Chain
Abstract. In this paper we study several structural properties of the monoids \poin of all injective order preserving partial transformations on a chain with n elements. Our main aim is to give a
Symmetric Inverse Semigroups
Decomposing charts Basic observations Commuting charts Centralizers of permutations Centralizers of charts Alternating semigroups \$S_n\$-normal semigroups Normal semigroups and congruences