Title :
On the Generation of (Minimal) Clones Containing Near-Unanimity Operations
Author :
Kerkhoff, Sebastian
Author_Institution :
Inst. fur Algebra, Tech. Univ. Dresden, Dresden, Germany
Abstract :
For a clone C that contains a near-unanimity operation, one can define λ(C) and μ(C) to be the smallest integers k1 and k2 such 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.
Keywords :
set theory; clones generation; minimal clones; near-unanimity operations; polymorphisms; sharp bounds; Algebra; Cloning; Electronic mail; Graphics; Lattices; Linear matrix inequalities; Upper bound; clone; generation of clones; graphic; majority operation; minimal clone; near-unanimity operation;
Conference_Titel :
Multiple-Valued Logic (ISMVL), 2012 42nd IEEE International Symposium on
Conference_Location :
Victoria, BC
Print_ISBN :
978-1-4673-0908-0
DOI :
10.1109/ISMVL.2012.22
