Minimal clones with few majority operations
英文摘要：
We characterize minimal clones generated by a majority function containing at most seven ternary operations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Minimal clones generated by majority operations
We determine all majority operations on a four-element set that generate a minimal clone.
math.RA
Minimal clones with many majority operations
We present two minimal clones containing 26 and 78 majority operations respectively, more than any other previously known example.
math.RA
Coarse classification of binary minimal clones
We classify binary minimal clones into seven categories: affine algebras, rectangular bands, $p$-cyclic groupoids, spirals, non-Taylor partial semilattices, melds, and dispersive algebras. Each category has nice enough properties to guarantee that any clone of one of these types contains a minimal clone of the same type.
math.RA
Minimal clones with weakly abelian representations
We show that a minimal clone has a nontrivial weakly abelian representation iff it has a nontrivial abelian representation, and that in this case all representations are weakly abelian.
math.RA
Majority-closed minions of Boolean functions
The 93 minions of Boolean functions stable under left composition with the clone of self-dual monotone functions are described. As an easy consequence, all $(C_1,C_2)$-stable classes of Boolean functions are determined for an arbitrary clone $C_1$ and for any clone $C_2$ containing the clone of self-dual monotone functions.
math.COmath.RA
Almost associative operations generating a minimal clone
Characterizations of "almost associative" binary operations generating a minimal clone are given for two interpretations of the term "almost associative". One of them uses the associative spectrum, the other one uses the index of nonassociativity to measure how far an operation is from being associative.
math.RA
更多相关论文收起更多论文
The minimal clones above the permutations
We determine the atoms of the interval of the clone lattice consisting of those clones which contain all permutations, on an infinite base set. This is equivalent to the description of the atoms of the lattice of transformation monoids above the permutations.
math.LOmath.RA
Equivalence of operations with respect to discriminator clones
For each clone C on a set A there is an associated equivalence relation, called C-equivalence, on the set of all operations on A, which relates two operations iff each one is a substitution instance of the other using operations from C. In this paper we prove that if C is a discriminator clone on a finite set, then there are only finitely many C-equivalence classes. Moreover, we show that the smallest discriminator clone is minimal with respect to this finiteness property. For discriminator clones of Boolean functions we explicitly describe the associated equivalence relations.
math.RA
All centralising monoids with majority witnesses on a four-element set
We study unary parts of centraliser clones on the set $\{0,1,2,3\}$, so-called centralising monoids. We describe and count all centralising monoids on the set $\{0,1,2,3\}$ having majority operations as witnesses, and we list the inclusion maximal proper submonoids of the full transformation monoid among them. This extends previous work by Goldstern, Machida and Rosenberg.
math.LOmath.RA
Examples, counterexamples, and structure in bounded width algebras
We study bounded width algebras which are minimal in the sense that every proper reduct does not have bounded width. We show that minimal bounded width algebras can be arranged into a pseudovariety with one basic ternary operation. We classify minimal bounded width algebras which have size at most three, and prove a structure theorem for minimal bounded width algebras which have no majority subalgebra, which form a pseudovariety with a commutative binary operation. As a byproduct of our results, we also classify minimal clones which have a Taylor term.
cs.CCmath.LOmath.RA
