Abstract
In this paper, we consider acts over commutative semigroups of idempotents (semilattices). We prove that an act over a semilattice is a partially ordered set. We obtain a full description of acts over a finite chain and a necessary condition for a partially ordered set to be an act over some semilattice.
Similar content being viewed by others
References
A. Yu. Avdeyev and I. B. Kozhukhov, “Acts over completely 0-simple semigroups,” Acta Cybernet., 14, No. 4, 523–531 (2000).
M. Kilp, U. Knauer, and A. V. Mikhalev, Monoids, Acts and Categories, Walter de Gruyter, Berlin (2000).
I. B. Kozhukhov and M. Yu. Maksimovskiy, “On automata over semilattices,” in: V. A. Barkhotkin, ed., System Analyses and Information Control Systems [in Russian], MIET, Moscow (2006), pp. 19–34.
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 14, No. 7, pp. 151–156, 2008.
Rights and permissions
About this article
Cite this article
Maksimovskiy, M.Y. Acts over semilattices. J Math Sci 164, 255–259 (2010). https://doi.org/10.1007/s10958-009-9726-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-009-9726-2