The rank of the endomorphism monoid of a uniform partition.
From MaRDI portal
Publication:2391158
Abstract: The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, the semigroup of those transformations of a finite set that leave a non-trivial uniform partition invariant. That involves proving that the rank of a wreath product of two symmetric groups is two and then use the fact that the endomorphism monoid of a partition is isomorphic to a wreath product of two full transformation semigroups. The calculation of the rank of these semigroups solves an open question.
The authors prove that the minimal possible cardinality for a generating set of the semigroup of all transformations of a finite set of cardinality at least three that leave a nontrivial uniform partition invariant equals four. For two other semigroups of all transformations which preserve (in a certain sense) the equivalence relation determined by a uniform partition as above it is shown that the minimal possible cardinality for a generating set is three.
Recommendations
- Idempotent rank in the endomorphism monoid of a nonuniform partition.
- Idempotent generation in the endomorphism monoid of a uniform partition
- On the ranks of certain monoids of transformations that preserve a uniform partition.
- Partial transformation monoids preserving a uniform partition.
- Relative ranks in the monoid of endomorphisms of an independence algebra.
Cites work
- COMBINATORIAL TECHNIQUES FOR DETERMINING RANK AND IDEMPOTENT RANK OF CERTAIN FINITE SEMIGROUPS
- COUNTABLE VERSUS UNCOUNTABLE RANKS IN INFINITE SEMIGROUPS OF TRANSFORMATIONS AND RELATIONS
- Generating continuous mappings with Lipschitz mappings
- Generators and factorisations of transformation semigroups
- scientific article; zbMATH DE number 46357 (Why is no real title available?)
- scientific article; zbMATH DE number 781164 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- Idempotent rank in finite full transformation semigroups
- Nilpotent ranks of semigroups of partial transformations.
- On generating countable sets of endomorphisms
- On idempotent ranks of semigroups of partial transformations.
- On relative ranks of full transformation semigroups
- On the nilpotent ranks of certain semigroups of transformations
- On the rank of the semigroup \(T_E(X)\)
- On the ranks of certain semigroups of order-preserving transformations
- Rank properties in finite inverse semigroups
- RANK PROPERTIES OF ENDOMORPHISMS OF INFINITE PARTIALLY ORDERED SETS
- Ranks of Semigroups Generated by Order-Preserving Transformations with a Fixed Partition Type
- Relative ranks in the monoid of endomorphisms of an independence algebra.
- The Magma algebra system. I: The user language
Cited in
(27)- Regular, unit-regular, and idempotent elements of semigroups of transformations that preserve a partition
- Elementary, finite and linear vN-regular cellular automata
- Bounding the minimal number of generators of groups and monoids of cellular automata
- Ranks of monoids of endomorphisms of a finite undirected path
- Presentations for singular wreath products
- Partial transformation monoids preserving a uniform partition.
- The relative rank of the endomorphism monoid of a finite \(G\)-set
- Idempotent rank in the endomorphism monoid of a nonuniform partition.
- Idempotent generation in the endomorphism monoid of a uniform partition
- A partial order on transformation semigroups that preserve double direction equivalence relation.
- On the monoids of transformations that preserve the order and a uniform partition.
- On Finite Monoids of Cellular Automata
- On certain semigroups of transformations that preserve a partition
- Ranks of finite semigroups of one-dimensional cellular automata
- Graphs and ranks of monoids
- The minimal number of generators of a finite semigroup.
- Generating wreath products of symmetric and alternating groups
- Variants of epigroups and primary conjugacy
- The rank of the semigroup of transformations stabilising a partition of a finite set
- On the ranks of certain monoids of transformations that preserve a uniform partition.
- Regular and unit-regular elements in various monoids of transformations
- On the minimal number of generators of endomorphism monoids of full shifts
- Cellular automata and finite groups
- On the semigroup of partition-preserving transformations whose characters are bijective
- Semigroups of transformations whose characters belong to a given semigroup
- On transformation semigroup induced by symmetric group characters
- Correction to: ``Reaching the minimum ideal in a finite semigroup: correcting the rank of wreath products
This page was built for publication: The rank of the endomorphism monoid of a uniform partition.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391158)
