Author:
Kaprinai Balázs,Machida Hajime,Waldhauser Tamás
Abstract
AbstractA binary operation f(x, y) is said to be lazy if every operation that can be obtained from f by composition is equivalent to f(x, y), f(x, x) or x. We describe lazy operations by identities (i.e., we determine all varieties of lazy groupoids), and we also characterize lazy groupoids up to isomorphism.
Publisher
Springer Science and Business Media LLC
Subject
Algebra and Number Theory
Reference7 articles.
1. Atre, A.K.: On a semigroup which is an inflation of its set of factorizable elements. Vignana Bharathi 1, 69–72 (1975)
2. Boltnev, A.A.: A set-theoretic description of semigroups of some varieties. Chebyshevskiĭ Sb. 6, 56–63 (2005). (in Russian)
3. Evans, T.: Products of points—some simple algebras and their identities. Am. Math. Mon. 74, 362–372 (1967)
4. Lehtonen, E., Waldhauser, T.: Minor posets of functions as quotients of partition lattices. Order 36, 23–41 (2019)
5. Machida, H., Rosenberg, I.G.: Essentially minimal clones of rank 3 on a three-element set. In: Drechsler, R., Wille, R. (eds.) 44th International Symposium on Multiple-Valued Logic (ISMVL 2014), pp. 97–102. IEEE Computer Society, Los Alamitos, CA (2014)