Abstract
A semigroup any two congruences of which commute as binary relations is called a permutable semigroup. We describe the structure of a permutable Munn semigroup of finite rank.
Similar content being viewed by others
References
W. D. Munn, “Fundamental inverse semigroups,” Quart. J. Math., 21, 157–170 (1970).
M. Petrich, Inverse Semigroups, Wiley, New York (1984).
V. D. Derech, “On permutable congruences on antigroups of finite rank,” Ukr. Mat. Zh., 56, No. 3, 346–351 (2004).
A. H. Clifford and G. B. Preston, The Algebraic Theory of Semigroups, American Mathematical Society, Providence, RI (1964).
H. Hamilton, “Permutability of congruences on commutative semigroups,” Semigroup Forum., 10, No. 1, 55–66 (1975).
Author information
Authors and Affiliations
Additional information
__________
Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 58, No. 6, pp. 742–746, June, 2006.
Rights and permissions
About this article
Cite this article
Derech, V.D. Structure of a permutable Munn semigroup of finite rank. Ukr Math J 58, 836–841 (2006). https://doi.org/10.1007/s11253-006-0107-4
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11253-006-0107-4