E-unitary inverse monoids and the Cayley graph of a group presentation. (English) Zbl 0676.20037

Let (X;R) be a presentation for the group G and let \(\Gamma\) (X;R) be the Cayley graph of this presentation. For each finite subgraph \(\Gamma\) of \(\Gamma\) (X;R) and \(g\in G\), let \(g\cdot \Gamma\) be the subgraph of \(\Gamma\) (X;R) with vertex set \(\{\) gh: h is a vertex of \(\Gamma\) \(\}\) ; there is an edge labelled x from gh to ghx in \(g\cdot \Gamma\) if the edge labelled x from h to hx occurs in \(\Gamma\). Let M(X;R) consist of the pairs (\(\Gamma\),g) where \(\Gamma\) is a finite connected subgraph of \(\Gamma\) (X;R) containing 1 and g as vertices. On M(X;R) define a multiplication by \((\Gamma,g)(\Gamma ',g')=(\Gamma \cup g\cdot \Gamma ',gg')\). It turns out that M(X;R) is an E-unitary inverse monoid generated by the elements \((\Gamma_ x,x)\), \(x\in X\), where \(\Gamma_ x\) has vertices 1 and x and one edge labelled x.
Given the presentation (X;R) for the group G, a category is constructed whose objects are diagrams. A diagram involving M(X;R) is proven to be an initial object in this category. From this it is proved that every X- generated E-unitary monoid having G as its maximum group image is an idempotent pure homomorphic image of M(X;R). For any variety \({\mathcal V}\) of groups, let \(\hat {\mathcal V}\) be the variety consisting of those inverse monoids S for which there exists an E-unitary inverse monoid N with greatest group homomorphic image in \({\mathcal V}\) and an idempotent separating homomorphism of N onto S. If G is free in \({\mathcal V}\) on X and has a presentation (X;R), then M(X;R) turns out to be free in \(\hat {\mathcal V}\) on X. In particular, if G is trivial, then M(X;R) is the free (monoid-) semilattice, and if G is the free group, then M(X;R) is the free inverse monoid.
The authors give a representation in the form of a McAlister P-semigroup for such monoids, investigate Green’s relations, explain the connection with Munn’s construction of the free inverse monoid in terms of birooted word trees, prove that the M(X;R) are completely semisimple and residually finite. A group is isomorphic to a maximal subgroup of M(X;R) if and only if it is finite and embeddable into the group G with presentation (X;R). There exists an obvious functor of the category of X- generated E-unitary inverse monoids into the category of X-generated groups, which associates with every E-unitary inverse monoid its greatest group image; the above construction yields a left adjoint of this functor.
The paper concludes with several concrete examples and a detailed description of the free product of E-unitary inverse monoids. In particular, if \((X_ 1;R_ 1)\) and \((X_ 2;R_ 2)\) are group presentations such that \(X_ 1\) and \(X_ 2\) are disjoint, then \(M(X_ 1\cup X_ 2;R_ 1,R_ 2)\) is isomorphic to the free product of \(M(X_ 1;R_ 1)\) and \(M(X_ 2;R_ 2)\).
Reviewer: F.Pastijn


20M05 Free semigroups, generators and relations, word problems
20F05 Generators, relations, and presentations of groups
20E10 Quasivarieties and varieties of groups
05C25 Graphs and abstract algebra (groups, rings, fields, etc.)
20M07 Varieties and pseudovarieties of semigroups
Full Text: DOI


[1] J.-C. Birget and J.L. Rhodes, Group theory via global semigroup theory, J. Algebra, to appear.; J.-C. Birget and J.L. Rhodes, Group theory via global semigroup theory, J. Algebra, to appear. · Zbl 0668.20048
[2] Eilenberg, S., Automata, (Languages and Machines, Vol. A (1974), Academic Press: Academic Press New York) · Zbl 0175.27902
[3] Eilenberg, S., Automata, (Languages and Machines, Vol. B (1976), Academic Press: Academic Press New York) · Zbl 0175.27902
[4] Higgins, P., Categories and Groupoids (1971), Van Nostrand-Rheinhold: Van Nostrand-Rheinhold New York · Zbl 0226.20054
[5] Jones, P., A basis theorem for free inverse semigroups, J. Algebra, 49, 172-190 (1977) · Zbl 0376.20034
[6] Jones, P., A graphical representation of the free product of \(E\)-unitary inverse semigroups, Semigroup Forum, 24, 195-221 (1982) · Zbl 0486.20035
[7] Jones, P., Free products of inverse semigroups, Trans. Amer. Math. Soc., 282, 293-318 (1984) · Zbl 0532.20032
[8] Knox, N., The inverse semigroup coproduct of an arbitrary non-empty collection of groups, (Doctoral Dissertation (1974), Tennesee State University)
[9] MacLane, S., Categories for the Working Mathematician (1971), Springer: Springer Berlin · Zbl 0232.18001
[10] McAlister, D., Inverse semigroups generated by a pair of groups, Proc. Royal. Soc. Edinburg, A77, 188-211 (1976) · Zbl 0365.20066
[11] McAlister, D.; McFadden, R., The free inverse semigroup on two commuting generators, J. Algebra, 32, 215-233 (1974) · Zbl 0298.20054
[12] Margolis, S.; Pin, J. E., Inverse semigroups and extensions of groups by semilattices, J. Algebra, 110, 2, 277-297 (1987) · Zbl 0625.20043
[13] Meakin, J., Regular expansions of regular semigroups, (Simon Stevin, 60 (1986)), 241-255 · Zbl 0607.20036
[14] Munn, W. D., Free inverse semigroups, Proc. London Math. Soc., 30, 385-404 (1974) · Zbl 0305.20033
[15] Pastijn, F., Inverse semigroup varieties generated by \(E\)-unitary inverse semigroups, Semigroup Forum, 24, 87-88 (1982) · Zbl 0503.20023
[16] Petrich, M., Inverse Semigroups (1984), Wiley: Wiley New York · Zbl 0546.20053
[17] M. Petrich and N.R. Reilly, \(E\); M. Petrich and N.R. Reilly, \(E\) · Zbl 0537.20032
[18] Rhodes, J.; Birget, J.-C., Almost finite expansions of arbitrary semigroups, J. Pure Appl. Algebra, 32, 239-287 (1984) · Zbl 0546.20055
[19] Serre, J.-P., Trees (1980), Springer: Springer Berlin · Zbl 0548.20018
[20] Tilson, B., Categories as algebra: An essential ingredient in the theory of monoids, J. Pure Appl. Algebra, 48, 1-2, 83-198 (1987) · Zbl 0627.20031
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.