Ukrainian Mathematical Journal

, Volume 58, Issue 6, pp 836–841

Structure of a permutable Munn semigroup of finite rank

  • V. D. Derech
Article

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    W. D. Munn, “Fundamental inverse semigroups,” Quart. J. Math., 21, 157–170 (1970).MATHMathSciNetGoogle Scholar
  2. 2.
    M. Petrich, Inverse Semigroups, Wiley, New York (1984).MATHGoogle Scholar
  3. 3.
    V. D. Derech, “On permutable congruences on antigroups of finite rank,” Ukr. Mat. Zh., 56, No. 3, 346–351 (2004).MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    A. H. Clifford and G. B. Preston, The Algebraic Theory of Semigroups, American Mathematical Society, Providence, RI (1964).MATHGoogle Scholar
  5. 5.
    H. Hamilton, “Permutability of congruences on commutative semigroups,” Semigroup Forum., 10, No. 1, 55–66 (1975).MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2006

Authors and Affiliations

  • V. D. Derech
    • 1
  1. 1.Vinnytsya National Technical UniversityVinnytsya

Personalised recommendations