Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-12-01T02:24:35.019Z Has data issue: false hasContentIssue false

Finite semigroups with commuting idempotents

Part of: Semigroups

Published online by Cambridge University Press:  09 April 2009

C. J. Ash
Affiliation:
Department of Mathematics, Monash University, Clayton, Victoria 3168, Australia
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.

We show that every such semigroup is a homomorphic image of a subsemigroup of some finite inverse semigroup. This shows that the pseudovariety generated by the finite inverse semigroups consists of exactly the finite semigroups with commuting idempotents.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1987

References

[1]Clifford, A. H. and Preston, G. B., The algebraic theory of semigroups, Vols. I & II, Math. Surveys No. 7 (Amer. Math. Soc, Providence, R. I., 1961 & 1967).Google Scholar
[2]Howie, J. M., An introduction to semigroup theory (L. M. S. Monographs, Academic Press, London, 1976).Google Scholar
[3]Lallement, G., Semigroups and combinatorial applications (Wiley, 1981).Google Scholar
[4]Margolis, S., ‘Problem M1’, Proceedings of Nebraska Conference on semigroups, edited by J. Meakin, p. 14 (1980).Google Scholar
[5]Margolis, S. and Pin, J. E., ‘Languages and inverse semigroups’, 11th ICALP, pp. 337346 (Lecture Notes in Computer Science 172, 1984).CrossRefGoogle Scholar
[6]Margolis, S. and Pin, J. E., ‘Graphs, inverse semigroups and languages’, Proceedings of 1984 Marquette conference on semigroups, pp. 85112.Google Scholar
[7]Pin, J. E., Variétés de langages formels (Masson, Paris, 1984).Google Scholar
[8]Ramsey, F. P., ‘On a problem of formal logic’, Proc. London Math. Soc. 30 (1930), 264286.CrossRefGoogle Scholar