7 problems
Let be a set and let be a partial order on with least element and greatest element . Let be the clone of operations preserving …
Let be a -element set with , and let be a clone over . Say that satisfies for every and satisfies…
Three strongly connected components conjecture. The digraph has at least three strongly connected components.
Three-element generated subalgebra conjecture. Under these hypotheses,
Two-element projection quotient conjecture. For every , there is a surjective homomorphism
Three-element reduction conjecture. Every clone on three elements that does not admit a minor-preserving map from has a minor-preserving map to one of the following t…
Countability conjecture. The minor equivalence relation on clones on finite domains has only countably many classes.