Hostname: page-component-77c89778f8-sh8wx Total loading time: 0 Render date: 2024-07-20T23:10:17.963Z Has data issue: false hasContentIssue false
  • English
  • Français

On semigroup presentations

Published online by Cambridge University Press:  20 January 2009

Edmund F. Robertson  and
Yusuf Ünlü
Edmund F. Robertson
Affiliation:
University of St AndrewsSt Andrews KY16 9SS, Scotland
Yusuf Ünlü
Affiliation:
Çukurova ÜniversitesiBalcali Adana, Turkey
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.

Semigroup presentations have been studied over a long period, usually as a means of providing examples of semigroups. In 1967 B. H. Neumann introduced an enumeration method for finitely presented semigroups analogous to the Todd–Coxeter coset enumeration process for groups. A proof of Neumann's enumeration method was given by Jura in 1978.

In Section 3 of this paper we describe a machine implementation of a semigroup enumeration algorithm based on that of Neumann. In Section 2 we examine certain semigroup presentations, motivated by the fact that the corresponding group presentation has yielded interesting groups. The theorems, although proved algebraically, were suggested by the semigroup enumeration program.

Type
Research Article
Information
Proceedings of the Edinburgh Mathematical Society , Volume 36 , Issue 1 , February 1993 , pp. 55 - 68
Copyright
Copyright © Edinburgh Mathematical Society 1993

References

REFERENCES

1.Campbell, C. M. and Thomas, R. M., On (2, n)-groups related to Fibonacci groups, Israel J. Math. 58 (1987), 370–380.CrossRefGoogle Scholar
2.Cannon, J. J., Dimino, L. A., Havas, G. and Watson, J. M., Implementation and analysis of the Todd–Coxeter algorithm, Math. Comp. 27 (1973), 463–490.CrossRefGoogle Scholar
3.Jura, A., Coset enumeration in a finitely presented semigroup, Canad. Math. Bull. 21 (1978), 37–46.CrossRefGoogle Scholar
4.Leech, J., Coset enumeration on digital computers, Proc. Cambridge Philos. Soc. 59 (1963), 257–267.CrossRefGoogle Scholar
5.Neumann, B. H., Some remarks on semigroup presentations, Canad. J. Math. 19 (1967), 1018–1026.CrossRefGoogle Scholar
6.Robertson, E. F. and Campbell, C. M., Symmetric presentations, in Group theory, Proceedings of the 1987 Singapore Conference (Walter de Gruyter, Berlin, New York 1989), 497–506.Google Scholar
7.Todd, J. A. and Coxeter, H. S. M., A practical method for enumerating cosets of a finite abstract group, Proc. Edinburgh Math. Soc. 5 (1936), 26–34.CrossRefGoogle Scholar