Abstract
We prove the following results: (1) Every group is a maximal subgroup of some free idempotent generated semigroup. (2) Every finitely presented group is a maximal subgroup of some free idempotent generated semigroup arising from a finite semigroup. (3) Every group is a maximal subgroup of some free regular idempotent generated semigroup. (4) Every finite group is a maximal subgroup of some free regular idempotent generated semigroup arising from a finite regular semigroup. As a technical prerequisite for these results we establish a general presentation for the maximal subgroups based on a Reidemeister-Schreier type rewriting.
Similar content being viewed by others
References
M. Brittenham, S. W. Margolis and J. Meakin, Subgroups of free idempotent generated semigroups need not be free, Journal of Algebra 321 (2009), 3026–3042.
M. Brittenham, S. W. Margolis and J. Meakin, Subgroups of free idempotent generated semigroups: full linear monoids, arXiv: 1009.5683.
The GAP Group, GAP — Groups, Algorithms, and Programming, Version 4.4.12; 2008 (http://www.gap-system.org).
D. Easdown, Biordered sets come from semigroups, Journal of Algebra 96 (1985), 581–591.
D. Easdown, M. Sapir and M. Volkov, Periodic elements of the free idempotent generated semigroup on a biordered set, International Journal of Algebra and Computation 20 (2010), 189–194.
D. G. Fitz-Gerald, On inverses of products of idempotents in regular semigroups, Journal of the Australian Mathematical Society 13 (1972), 335–337.
J. A. Green, On the structure of semigroups, Annals of Mathematics. Second Series 54 (1951), 163–172.
G. Havas, Symbolic and algebraic calculation, Basser Computing Dept., Technical Report, Vol. 89, Basser Department of Computer Science, University of Sydney, Sydney, Australia, 1969.
G. Havas, P. E. Kenne, J. S. Richardson and E. F. Robertson, A Tietze transformation program, in Computational Group Theory (M.D. Atkinson, ed.), Proceedings of LMS Symposium on Computational Group Theory, Durham 1982, Academic Press, New York, 1984.
P. M. Higgins, Techniques of Semigroup Theory, The Clarendon Press, New York, 1992.
J. M. Howie, Fundamentals of Semigroup Theory, London Mathematical Society Monographs, New Series, Vol. 12, The Clarendon Press, New York, 1995.
B. McElwee, Subgroups of the free semigroup on a biordered set in which principal ideals are singletons, Communications in Algebra 30 (2002), 5513–5519.
K. S. S. Nambooripad, Structure of regular semigroups. I, Memoirs of the American Mathematical Society 224 (1979).
K. S. S. Nambooripad and F. Pastijn, Subgroups of free idempotent generated regular semigroups, Semigroup Forum 21 (1980), 1–7.
F. Pastijn, Idempotent generated completely 0-simple semigroups, Semigroup Forum 15 (1977), 41–50.
F. Pastijn, The biorder on the partial groupoid of idempotents of a semigroup, Journal of Algebra 65 (1980), 147–187.
M. Petrich, The translational hull of a completely 0-simple semigroup, Glasgow Mathematical Journal 9 (1968), 1–11.
E. F. Robertson, Tietze transformations with weighted substring search, Journal of Symbolic Computation 6 (1988), 59–64.
D. J. S. Robinson, A Course in the Theory of Groups, Springer, New York, 1996.
N. Ruškuc, Presentations for subgroups of monoids, Journal of Algebra 220 (1999), 365–380.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by an EPSRC Postdoctoral Fellowship, and partially supported by FCT and FEDER, project POCTI-ISFL-1-143 of Centro de Álgebra da Universidade de Lisboa, and by the project PTDC/MAT/69514/2006.
Rights and permissions
About this article
Cite this article
Gray, R., Ruskuc, N. On maximal subgroups of free idempotent generated semigroups. Isr. J. Math. 189, 147–176 (2012). https://doi.org/10.1007/s11856-011-0154-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11856-011-0154-x