Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T02:17:16.400Z Has data issue: false hasContentIssue false

Any group is a maximal subgroup of the semigroup of binary relations on some set†

Published online by Cambridge University Press:  18 May 2009

G. B. Preston
Affiliation:
Monash University, Clayton, Australia, 3168
Rights & Permissions [Opens in a new window]

Extract

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 the theorem stated in the title is a corollary to a result of K. A. Zaretskii [5] and a theorem of G. Birkhoff [1]. The construction we use further shows that all groups with cardinal less than or equal to the cardinal of the given group are simultaneously realised as maximal subgroups of the same semigroup of binary relations ℬx. For finite or countable groups, when Xmay be taken to be finite or countable, respectively, and for an entirely different method of proof, the paper of J. S. Montague and R. J. Plemmons [3] should be consulted. For two further proofs of the theorem of the title to this note, this time for any X, see also R. J. Plemmons and B. M. Schein [4] and A. H. Clifford [2].

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1973