Abstract
This paper surveys some of the authors’ recent and ongoing work aimed at developing a theory of presentations of inverse monoids analogous to the theory of generators and relations for groups. We regard inverse monoids as a class of algebras of type 〈2,1,0〉 and study presentations of inverse monoids from this point of view. The paper is concerned with two basic decision problems for inverse monoid presentations: the word problem and the E-unitary problem. We develop the general construction of a birooted word graph associated with an inverse monoid presentation and show how it can be used as a basic tool in the study of the word problem. We indicate several cases in which the word problem can be solved using these techniques. We study the E-unitary problem for inverse monoids of the form M=Inv〈X|w=1〉 where w is in the free inverse monoid on X. We show how the Lyndon diagrams of combinatorial group theory may be used to analyze the problem and we study several examples and special cases in detail.
Reasearch supported by NSF Grant No. DMS 8503010
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S.I. Adjan,’Defining relations and algorithmic problems for groups and semigroups’, Tr. Mat. Inst. Steklov 85 (Russian); Am. Math. Soc. (translation) 152, 1967.
A.H. Clifford and G.B. Preston, The Algebraic Theory of Semigroups, Amer. Math. Soc., Math Surveys 7, Vol. 1, 1961.
S. Eilenberg, Automata, Languages and Machines, Vol.A, Academic Press, New York, 1974.
J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley,1979.
R.C. Lyndon and P.E. Schupp, Combinatorial Group Theory, Springer-Verlag, 1977.
W. Magnus,’Das Identitäts-Problem für Gruppen mit einer definierenden Relation’, Math. Ann. 106, 295–307, 1932.
S.W. Margolis and J.C. Meakin,’E-unitary inverse monoids and the Cayley graph of a group presentation’, submitted for publication.
S.W. Margolis and J.C. Meakin,’On a class of one relator inverse monoid presentations’, Proc. L.S.U. Semigroup Conference, Louisiana State University, 1986, to appear.
S.W. Margolis and J.C. Meakin,’Inverse monoids presented by idempotent relators’, Manuscript in preparation.
S.W. Margolis and J.C. Meakin,’On the E-unitary problem for inverse monoid presentations’, Manuscript in preparation.
D.B. McAlister and R. McFadden,’The free inverse semigroup on two commuting generators’, J. Algebra, 32, 215–233, 1974.
W.D. Munn,’Free inverse semigroups’, Proc. London Math. Soc. (3)29, 385–404, 1974.
M. Nivat and J.F. Perrot,’Une généralisation du monoïde bicyclique’,C.R. Acad. Sci. Paris, 217A, 824–827, 1970.
M. Petrich, Inverse Semigroups, Wiley, 1984.
C. Reutenauer,’Une topologie du monoïde libre’, Semigroup Forum 18, No. 1, 33–50, 1979.
H.E. Scheiblich,’Free inverse semigroups’, Proc. Amer. Math. Soc. 38 1–7, 1973.
J.-P. Serre, Trees, Springer-Verlag, 1980.
J.B. Stephen,’Presentations of inverse monoids’, submitted for publication.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 D. Reidel Publishing Company
About this chapter
Cite this chapter
Margolis, S.W., Meakin, J.C., Stephen, J.B. (1987). Some Decision Problems for Inverse Monoid Presentations. In: Goberstein, S.M., Higgins, P.M. (eds) Semigroups and Their Applications. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-3839-7_13
Download citation
DOI: https://doi.org/10.1007/978-94-009-3839-7_13
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-8209-9
Online ISBN: 978-94-009-3839-7
eBook Packages: Springer Book Archive