The complexity of finding coset-generating polymorphisms and the promise metaproblem

TL;DR

This paper proves that determining the existence of coset-generating polymorphisms is NP-complete and explores the complexity of promise versions of related metaproblems, identifying conditions for polynomial-time solvability.

Contribution

It establishes NP-completeness for the coset-generating polymorphism metaproblem and analyzes the complexity of promise variants with specific polymorphism conditions.

Findings

Metaproblem for coset-generating polymorphisms is NP-complete.

Promise metaproblem is in P if certain polymorphisms exist.

Creation-metaproblem for Maltsev polymorphisms is in P under specific conditions.

Abstract

We show that the metaproblem for coset-generating polymorphisms is NP-complete, answering a question of Chen and Larose: given a finite structure, the computational question is whether this structure has a polymorphism of the form $(x,y,z) \mapsto x y^{-1} z$ with respect to some group; such operations are also called coset-generating, or heaps. Furthermore, we introduce a promise version of the metaproblem, parametrised by two polymorphism conditions $\Sigma_1$ and $\Sigma_2$ and defined analogously to the promise constraint satisfaction problem. We give sufficient conditions under which the promise metaproblem for $(\Sigma_1,\Sigma_2)$ is in P and under which it is NP-hard. In particular, the promise metaproblem is in P if $\Sigma_1$ states the existence of a Maltsev polymorphism and $\Sigma_2$ states the existence of an abelian heap polymorphism -- despite the fact that neither the metaproblem for $\Sigma_1$ nor the metaproblem for $\Sigma_2$ is known to be in P. We also show that the creation-metaproblem for Maltsev polymorphisms, under the promise that a heap polymorphism exists, is in P if and only if there is a uniform polynomial-time algorithm for CSPs with a heap polymorphism.