Minimal Algebras of Binary Operations of Rank 3
Abstract
The problem of finding minimal algebras of binary operations of rank 3 is considered in this paper. Solving this problem is the first step for constructing a lattice of algebras of binary operations of rank 3. The construction of such a lattice is one of the problems of universal algebra, in particular, the theory of lattices. The article describes an algorithm for finding minimal algebras, which is based on the idempotency property of operations generating minimal algebras. This algorithm was implemented in Python. The results of the algorithm are presented in tabular form.
References
Erlagol notebook. Selected open questions on algebra and model theory posed by participants in Erlagol school-conferences, A. G. Pinus, E. N. Poroshenko, and S. V. Sudoplatov, eds., Novosibirsk, Russia: NSTU Publishing House, 2018 (in Russian).
B. Csakany, “All minimal clones on three-element set,” Acta Cybernetyca, vol. 6, pp. 227–237, 1983.
N. A. Peryazev, Yu. V. Peryazeva, and I. K. Sharankhaev, “Minimal algebras of unary multioperations,” Izvestiya SPbETU "LETI", no. 2, pp. 22–26, 2006 (in Russian).
N. A. Peryazev, “Clones, co-clones, hyperclones and superclones,” Scientific notes of Kazan State University. Phys.-Math. sciences, vol. 151, no. 2, pp. 120–125, 2009 (in Russian).
D. Lau, Function Algebras on Finite Sets, Berlin: Springer-Verlag, 2006; doi: 10.1007/3-540-36023-9
This work is licensed under a Creative Commons Attribution 4.0 International License.
