Subgroups of free idempotent generated semigroups need not be free.
From MaRDI portal
Publication:2390500
DOI10.1016/j.jalgebra.2008.12.017zbMath1177.20064arXiv0808.1827OpenAlexW2963524535MaRDI QIDQ2390500
Stuart W. Margolis, Mark Brittenham, John C. Meakin
Publication date: 23 July 2009
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0808.1827
Related Items (33)
Obituary: Tribute to K.S.S. Nambooripad ⋮ ON MAXIMAL SUBGROUPS OF IDEMPOTENT-GENERATED SEMIGROUPS ASSOCIATED WITH BIORDERED SETS ⋮ A note on maximal subgroups of free idempotent generated semigroups over bands. ⋮ Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals ⋮ Free idempotent generated semigroups: subsemigroups, retracts and maximal subgroups ⋮ NP-Completeness in the gossip monoid ⋮ Regular semigroups weakly generated by idempotents ⋮ Effective dimension of finite semigroups. ⋮ Finite complete rewriting systems for regular semigroups. ⋮ A groupoid approach to regular \(\ast \)-semigroups ⋮ On the structure of semigroups whose regular elements are completely regular ⋮ A group-theoretical interpretation of the word problem for free idempotent generated semigroups ⋮ Every group is a maximal subgroup of a naturally occurring free idempotent generated semigroup. ⋮ The minimal number of generators of a finite semigroup. ⋮ A tribute to John Meakin on the occasion of his 75th birthday ⋮ PERIODIC ELEMENTS OF THE FREE IDEMPOTENT GENERATED SEMIGROUP ON A BIORDERED SET ⋮ Free idempotent generated semigroups and endomorphism monoids of independence algebras ⋮ A Note on Free Idempotent Generated Semigroups over the Full Monoid of Partial Transformations ⋮ On maximal subgroups of free idempotent generated semigroups. ⋮ Regular centralizers of idempotent transformations. ⋮ EVERY GROUP IS A MAXIMAL SUBGROUP OF THE FREE IDEMPOTENT GENERATED SEMIGROUP OVER A BAND ⋮ On properties not inherited by monoids from their Schützenberger groups. ⋮ The free idempotent generated locally inverse semigroup ⋮ Semigroup actions, covering spaces and Schützenberger groups. ⋮ Structure theory of regular semigroups ⋮ Free idempotent generated semigroups over bands and biordered sets with trivial products ⋮ Free idempotent generated semigroups: the word problem and structure via gain graphs ⋮ Presentations for singular wreath products ⋮ A ŠVARC–MILNOR LEMMA FOR MONOIDS ACTING BY ISOMETRIC EMBEDDINGS ⋮ Free idempotent generated semigroups and endomorphism monoids of free \(G\)-acts. ⋮ Elaborating the word problem for free idempotent-generated semigroups over the full transformation monoid ⋮ Maximal subgroups of free idempotent generated semigroups over the full linear monoid ⋮ The Mathematical Work of K. S. S. Nambooripad
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Translational hulls and block designs
- Biordered sets come from semigroups
- Subgroups of free idempotent generated regular semigroups
- The biorder on the partial groupoid of idempotents of a semigroup
- Relationships between combinatorics and 0-simple semigroups
- Completely O-simple semigroups and their associated graphs and groups
- Idempotent-generated completely O-simple semigroups
- A topological approach to inverse and regular semigroups.
- Bass-Serre theory for groupoids and the structure of full regular semigroup amalgams
- PERIODIC ELEMENTS OF THE FREE IDEMPOTENT GENERATED SEMIGROUP ON A BIORDERED SET
- Structure of regular semigroups. I
- SUBGROUPS OF THE FREE SEMIGROUP ON A BIORDERED SET IN WHICH PRINCIPAL IDEALS ARE SINGLETONS
- Products of idempotents in algebraic monoids
- The Subsemigroup Generated By the Idempotents of a Full Transformation Semigroup
- On products of idempotent matrices
- On finite 0-simple semigroups and graph theory
- On inverses of products of idempotents in regular semigroups
This page was built for publication: Subgroups of free idempotent generated semigroups need not be free.