Skip to main content
Log in

Structure of a permutable Munn semigroup of finite rank

  • Published:
Ukrainian Mathematical Journal Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. D. Munn, “Fundamental inverse semigroups,” Quart. J. Math., 21, 157–170 (1970).

    MATH  MathSciNet  Google Scholar 

  2. M. Petrich, Inverse Semigroups, Wiley, New York (1984).

    MATH  Google Scholar 

  3. V. D. Derech, “On permutable congruences on antigroups of finite rank,” Ukr. Mat. Zh., 56, No. 3, 346–351 (2004).

    Article  MATH  MathSciNet  Google Scholar 

  4. A. H. Clifford and G. B. Preston, The Algebraic Theory of Semigroups, American Mathematical Society, Providence, RI (1964).

    MATH  Google Scholar 

  5. H. Hamilton, “Permutability of congruences on commutative semigroups,” Semigroup Forum., 10, No. 1, 55–66 (1975).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

__________

Translated from Ukrains’kyi Matematychnyi Zhurnal, Vol. 58, No. 6, pp. 742–746, June, 2006.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11253-006-0107-4

Keywords

Navigation