On the Generation of (Minimal) Clones Containing Near-Unanimity Operations
Sebastian Kerkhoff · 2012
For a clone C that contains a near-unanimity operation, one can define λ(C) and μ(C) to be the smallest integers k1and k2such that C is generated by its k1-ary part and can be written as the set of polymorphisms of its k2-th graphic, respectively. In this paper, we discuss the meaning of the functions λ and μ, elaborate the connection between them, derive some (sharp) bounds, and calculate the functions values for some selected (minimal) clones.