Abstract

We show that a finite algebra has a Taylor operation if and only if it has an operation satisfying a particular set of 6-ary Taylor identities. As a consequence we get the first strong Mal’cev condition for the family of locally finite varieties omitting the unary type. This is of interest to combinatorialists, as it is conjectured that a Constraint Satisfaction Problem defined by a core relational structure is polynomial time solvable exactly when a certain associated variety omits the unary type. Our result implies that the problem of deciding if a core relational structure meets this characterisation is itself in NP.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call