Generating clones with conservative near-unanimity operation

TL;DR

This paper investigates the size of generating sets for clones containing a conservative near-unanimity operation, providing sharp lower bounds for arity three based on the Baker-Pixley theorem.

Contribution

It establishes lower bounds on the size of generating sets for clones with conservative near-unanimity operations, especially sharp results for arity three.

Findings

Lower bounds for all arities of clones with conservative near-unanimity operations.

Sharp bounds achieved for arity three.

Extension of Baker-Pixley theorem implications.

Abstract

Due to the Baker-Pixley theorem we know that every clone over a finite domain $A$ containing a near-unanimity operation $g$ is finitely generated. Therefore there exists an integer $k$ such that the clone is generated by its $k$-ary part. In this paper we are interested in the size of $k$ for a fixed $A$ and fixed arity of a conservative $g$. We obtain lower bounds for all arities and they turn out to be sharp for arity three.