Submaximal clones over a three-element set up to minor-equivalence

Abstract: We study clones modulo minor homomorphisms, which are mappings from one clone to another preserving arities of operations and respecting permutation and identification of variables. Minor-equivalent clones satisfy the same sets of identities of the form

f (x_{1}, d o t s, x_{n}) a p p r o x g (y_{1}, d o t s, y_{m})

, also known as minor identities, and therefore share many algebraic properties. Moreover, it was proved that the complexity of the

o p e r a t o r n a m e C S P

of a finite structure

m a t h b b A

only depends on the set of minor identities satisfied by the polymorphism clone of

m a t h b b A

. In this article we consider the poset that arises by considering all clones over a three-element set with the following order: we write

m a t h c a l C p r e c e q_{m a t h r m m} m a t h c a l D

if there exists a minor homomorphism from

m a t h c a l C

to

m a t h c a l D

. We show that the aforementioned poset has only three submaximal elements.

Cites work

Cited in

(1)

Multisorted Boolean clones determined by binary relations up to minion homomorphisms

This page was built for publication: Submaximal clones over a three-element set up to minor-equivalence

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