Generating clones with conservative near-unanimity operation

MaRDI QIDQ4583863zbMATH OpenFDO

Authors Johannes Greiner

Publication date 3 September 2018

Full work available at URL https://arxiv.org/abs/1503.07986, http://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-26-number-3-5-2016/mvlsc-26-3-5-p-515-524/

zbMATH Keywords

lower boundgenerationclonesconservative operationBaker-Pixley theoremnear-unanimity operation

Mathematics Subject Classification ID

Operations and polynomials in algebraic structures, primal algebras (08A40)

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.

Recommendations

• On the generation of clones containing near-unanimity operations
• scientific article; zbMATH DE number 3961691
• The generation of clones with majority operations
• Finitely generated clones of terms
• MINIMAL CLONES OF CONSERVATIVE FUNCTIONS

Cited in

(5)

• On the generation of clones containing near-unanimity operations
• Minimal clones generated by majority operations
• Finitely generated clones of terms
• The generation of clones with majority operations
• Independence of clones as a criterion for voting rules

This page was built for publication: Generating clones with conservative near-unanimity operation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583863)