Publication | Open Access
A presentation for the monoid of uniform block permutations
48
Citations
2
References
2003
Year
Uniform Block PermutationsMonoid NCombinatorial DesignCombinatorial Design TheoryAlgebraic CombinatoricsTransformation SemigroupsUniversal AlgebraDiscrete MathematicsPartially Ordered SetCombinatorial OptimizationFactorisable Inverse Monoid
The monoid n of uniform block permutations is the factorisable inverse monoid which arises from the natural action of the symmetric group on the join semilattice of equivalences on an n -set; it has been described in the literature as the factorisable part of the dual symmetric inverse monoid. The present paper gives and proves correct a monoid presentation for n . The methods involved make use of a general criterion for a monoid generated by a group and an idempotent to be inverse, the structure of factorisable inverse monoids, and presentations of the symmetric group and the join semilattice of equivalences on an n -set.
| Year | Citations | |
|---|---|---|
Page 1
Page 1