Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-09T20:18:24.748Z Has data issue: false hasContentIssue false
  • English
  • Français

Counting completely 0-simple and completely simple semigroups

Published online by Cambridge University Press:  14 November 2011

C. H. Houghton
C. H. Houghton
Affiliation:
Department of Pure Mathematics, University College, Cardiff
Get access Rights & Permissions [Opens in a new window]

Synopsis

Formulae are derived for the numbers of completely 0-simple and completely simple semigroups with m ℒ-classes, n ℜ-classes and underlying finite group G.

Type
Research Article
Information
Proceedings of the Royal Society of Edinburgh Section A: Mathematics , Volume 79 , Issue 3-4 , 1978 , pp. 293 - 297
Copyright
Copyright © Royal Society of Edinburgh 1978

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1Burnside, W.Theory of groups of finite order, 2nd edn. (Cambridge: Univ. Press, 1911).Google Scholar
2Harary, F.On the number of bi-colored graphs. Pacific J. Math. 8 (1958), 743–755.CrossRefGoogle Scholar
3Harary, F. and Palmer, E. M.Graphical enumeration (New York: Academic Press, 1973).Google Scholar
4Howie, J. M.An introduction to semigroup theory (London: Academic Press, 1976).Google Scholar
5Houghton, C. H.Completely 0-simple semigroups and their associated graphs and groups. Semigroup Forum 14 (1977), 41–67.CrossRefGoogle Scholar
6Rees, D.On semi-groups. Proc. Cambridge Philos. Soc. 36 (1940), 387–400.CrossRefGoogle Scholar