The minimal number of generators of a finite semigroup.
From MaRDI portal
Publication:467521
DOI10.1007/s00233-013-9521-8zbMath1321.20048arXiv1307.8280OpenAlexW2014389955MaRDI QIDQ467521
Publication date: 3 November 2014
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.8280
Semigroups of transformations, relations, partitions, etc. (20M20) Free semigroups, generators and relations, word problems (20M05)
Related Items (18)
Ranks of ideals in inverse semigroups of difunctional binary relations ⋮ On Finite Monoids of Cellular Automata ⋮ Motzkin monoids and partial Brauer monoids ⋮ Ranks of finite semigroups of one-dimensional cellular automata ⋮ Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals ⋮ A subsemigroup of the rook monoid ⋮ The relative rank of the endomorphism monoid of a finite \(G\)-set ⋮ On the minimal number of generators of endomorphism monoids of full shifts ⋮ Cellular automata and finite groups ⋮ THE IDEMPOTENT-GENERATED SUBSEMIGROUP OF THE KAUFFMAN MONOID ⋮ Semigroups of partial transformations with kernel and image restricted by an equivalence ⋮ Random ubiquitous transformation semigroups ⋮ Chains of subsemigroups ⋮ Ehresmann theory and partition monoids ⋮ Bounding the minimal number of generators of groups and monoids of cellular automata ⋮ Structure of principal one-sided ideals ⋮ Presentations for singular wreath products ⋮ Sandwich semigroups in diagram categories
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dixon's theorem and random synchronization
- Équipotence et unicité de systèmes générateurs minimaux dans certains monoides
- Random generation of finite and profinite groups and group enumeration.
- Quelques propriétés des systèmes générateurs minimaux des monoides. (Some properties of minimal generating systems of monoids)
- Congruences on monoids of transformations preserving the orientation on a finite chain.
- On the ranks of certain semigroups of order-preserving transformations
- Completely O-simple semigroups and their associated graphs and groups
- Constructive techniques for labeling constant weight Gray codes with applications to minimal generating sets of semigroups
- Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups
- On maximal subgroups of free idempotent generated semigroups.
- Chains of subgroups in symmetric groups
- The probability of generating a finite simple group
- Subgroups of free idempotent generated semigroups need not be free.
- The rank of the endomorphism monoid of a uniform partition.
- Improved lower bounds for the complexity of finite semigroups
- The probability of generating a finite classical group
- Maximal subgroups of free idempotent generated semigroups over the full linear monoid
- Maximal subgroups of free idempotent-generated semigroups over the full transformation monoid
- On the Ranks of Certain Semigroups of Orientation Preserving Transformations
- ON THE SINGULAR PART OF THE PARTITION MONOID
- ENUMERATING FINITE GROUPS
- On the Monoids of Transformations that Preserve the Order and a Uniform Partition
- Idempotent rank in finite full transformation semigroups
- PRESENTATIONS FOR SINGULAR SUBSEMIGROUPS OF THE PARTIAL TRANSFORMATION SEMIGROUP
- PERIODIC ELEMENTS OF THE FREE IDEMPOTENT GENERATED SEMIGROUP ON A BIORDERED SET
- On the ranks of certain finite semigroups of transformations
- Idempotents in completely 0-simple semigroups
- Idempotent generators in finite full transformation semigroups
- COMBINATORIAL TECHNIQUES FOR DETERMINING RANK AND IDEMPOTENT RANK OF CERTAIN FINITE SEMIGROUPS
- HALL'S CONDITION AND IDEMPOTENT RANK OF IDEALS OF ENDOMORPHISM MONOIDS
- Maximal subsemigroups of finite semigroups
- On finite 0-simple semigroups and graph theory
- Generating Sets of Completely 0-Simple Semigroups
- Idempotents in partial transformation semigroups
- The probability of generating the symmetric group
This page was built for publication: The minimal number of generators of a finite semigroup.
