On factorisations and generators in transformation semigroups.
From MaRDI portal
A cycle-style notation is introduced for members of the full transformation semigroup similar to that used by Lipscomb for partial one-to-one maps. This approach is used to study generating sets of the submonoids \(T_{n,r}\) of \(T_n\) consisting of the union of the symmetric group and the ideal of all mappings with range of cardinality no greater than \(r\) (\(\leq n\)). The least number of singular elements in any generating set for \(T_{n,r}\) is the number of partitions of \(n\) with \(r\) terms.
Recommendations
Cited in
(14)- Generating sets of finite singular transformation semigroups.
- SgpDec: cascade (de)compositions of finite transformation semigroups and permutation groups
- Minimal relative generating sets of some partial transformation semigroups
- On straight words and minimal permutators in finite transformation semigroups
- Rank Properties of the Semigroup of Singular Transformations on a Finite Set
- Generators and factorisations of transformation semigroups
- scientific article; zbMATH DE number 1135610 (Why is no real title available?)
- Centralisers in the infinite symmetric inverse semigroup.
- Factor generalized be-semigroups through homomorphisms
- Characterizations of Cayley graphs of finite transformation semigroups with restricted range
- On products of 3-paths in finite full transformation semigroups
- scientific article; zbMATH DE number 7164302 (Why is no real title available?)
- Generating sets in orthogonal and symplectic rook monoids
- Generating sets of finite transformation semigroups PK(n,r) and K(n,r).
This page was built for publication: On factorisations and generators in transformation semigroups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1780013)
