Abstract
It is a well-known consequence of the Baker-Pixley-Theorem that any clone containing a near-unanimity operation is finitely generated, leading to the question what arity the generating functions must have. In this paper, we show that, for arbitrary d ≥ 2 and large enough n, (n − 1)d − 1 is the smallest integer k such that, for every clone C on an n-element set that contains a (d + 1)-ary near-unanimity operation, C (k) generates C.
Similar content being viewed by others
References
Baker K.A., Pixley F.: Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems. Math. Z. 143, 165–174 (1975)
Lakser H.: Finitely generated clones of terms. Algebra Universalis 26, 78–89 (1989)
Pöschel R., Kalužnin L.A.: Funktionen- und Relationenalgebren. Deutscher Verl. der Wiss., Berlin (1979)
Author information
Authors and Affiliations
Corresponding author
Additional information
Presented by A. Szendrei.
Rights and permissions
About this article
Cite this article
Kerkhoff, S. On the generation of clones containing near-unanimity operations. Algebra Univers. 65, 61–72 (2011). https://doi.org/10.1007/s00012-011-0117-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00012-011-0117-4