Abstract
A monoidM and a latticeL arealgebraic if there is an algebraA with endomorphism monoid EndA ≅ M and subalgebra lattice SuA ≅L. For each chainC we characterize those monoidsM for whichM and C are algebraic. In particular we show that a finite monoidM is algebraic with the three-chain iff the “equalizers” ofM form a chainE ≤3. The same assertion however fails for infinite monoids. This generalizes the corresponding result for two-chains and solves a problem posed by B. Jónsson ([2], p. 147). We settle the same question for all longer chainsK.
Similar content being viewed by others
References
Gould, M. andPlatt, C,Versatile monoids. Algebra Universalis1 (1971), 54.
Jónsson, B.,Topics in Universal Algebra. Springer-Verlag, Lecture Notes in Mathematics#250 (1970).
Sauer, N. andStone, M. G.,Foliations and applications to structure problems. Acta. Math. Hung.53 (1–2) (1989), 43–54.
Sauer, N., Stone, M. G. andBirkenhead, R.,The algebraic representation of semigroups and lattices; representing lattice extensions. Acta Sci. Math.43 (1981), 255–261.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sauer, N., Stone, M.G. Endomorphism monoids of algebras whose subalgebra lattices are chains. Algebra Universalis 28, 214–229 (1991). https://doi.org/10.1007/BF01190853
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01190853