Hostname: page-component-6bb9c88b65-2jdt9 Total loading time: 0 Render date: 2025-07-24T10:03:57.111Z Has data issue: false hasContentIssue false
  • English
  • Français

Free Objects in Certain Varieties of Inverse Semigroups

Published online by Cambridge University Press:  20 November 2018

S. W. Margolis ,
J. C. Meakin  and
J. B. Stephen
S. W. Margolis
Affiliation:
Department of Computer Science, University of Nebraska-Lincoln, Lincoln, Nebraska 68588, U.S.A.
J. C. Meakin
Affiliation:
Department of Mathematics and Statistics, University of Nebraska-Lincoln, Lincoln, Nebraska 68588, U.S.A.
J. B. Stephen
Affiliation:
Department of Mathematics, Northern Illinois University, DeKalb, Illinois 60615, U.S.A.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

In this paper it is shown how the graphical methods developed by Stephen for analyzing inverse semigroup presentations may be used to study varieties of inverse semigroups. In particular, these methods may be used to solve the word problem for the free objects in the variety of inverse semigroups generated by the five-element combinatorial Brandt semigroup and in the variety of inverse semigroups determined by laws of the form xn = xn + 1. Covering space methods are used to study the free objects in a variety of the form ∨ where is a variety of inverse semigroups and is the variety of groups.

Keywords

20M0520M1803D40

Information

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 42 , Issue 6 , 01 December 1990 , pp. 1084 - 1097
Copyright
Copyright © Canadian Mathematical Society 1990

Footnotes

Research supported by N.S.F. grant DMS 8702019.

References

1. Clifford, A.H. and Preston, G.B., The algebraic theory of semigroups, Math Surveys No. 7, Amer. Math. Soc. Providence, Vol. I (1961), Vol. II (1967).Google Scholar
2. Grätzer, G., Universal algebra 2nd éd., Springer (1979).Google Scholar
3. Higgins, P., Categories and groupoids, Van Nostrand-Reinhold, New York, 1971.Google Scholar
4. Hoproft, J.E. and Ullman, J.D., Formal languages and their relation to automata, Addison- Wesley, 1969.Google Scholar
5. Lallement, G., Semigroups and combinatorial applications, Wiley, 1979.Google Scholar
6. Lothaire, M., Combinatorics on words, Encyclopedia of mathematics and its applications, Addison- Wesley, 1983.Google Scholar
7. Margolis, S., Meakin, J. and Stephen, J., Some decision problems for inverse monoid presentations, in “Semigroups and their applications”, Goberstein, Higgins, (Ed). D. Reidel (1987), 99–110.CrossRefGoogle Scholar
8. Margolis, S. and Meakin, J., Inverse monoids, trees and context-free languages, Trans. Amer. Math. Soc. (to appear).Google Scholar
9. Meakin, J., Automata and the word problem, in “Formal Properties of Finite Automata and Applications”, Lecture Notes in Computer Science 386, J.E. Pin, (Ed). Springer-Verlag (1989), 89–103.Google Scholar
10. Petrich, M., Inverse semigroups, Wiley Interscience, 1984.Google Scholar
11. Reilly, N.R., Free combinatorial strict inverse semigroups, J. Lond. Math. Soc. (2) 39 (1989), 102-120.Google Scholar
12. Serre, J.P., Trees, Springer-Verlag, 1980.CrossRefGoogle Scholar
13. Stallings, J., Topology of finite graphs, Inv. Math. 71 (1983), 551–565.Google Scholar
14. Stephen, J.B., Presentations of inverse monoids, J. Pure Appl. Algebra 63 (1990) no. 1, 81-112.Google Scholar
15. Stephen, J.B., Contractive presentations of inverse monoids, preprint.Google Scholar