Dice Question Streamline Icon: https://streamlinehq.com

Necessity of plurimorphisms versus sufficiency of polymorphisms

Ascertain whether computational complexity in the valued PCSP framework is fully determined by polymorphisms alone or whether plurimorphisms strictly add expressive power; either establish equivalence or produce a separating example.

Information Square Streamline Icon: https://streamlinehq.com

Background

The paper’s reductions rely on plurimorphisms (finite families of weightings) rather than single polymorphisms, raising the question of necessity. If polymorphisms suffice, the theory could be simplified; if not, identifying minimal additional information needed would be crucial.

Resolving this will shape the algebraic foundation and the kinds of homomorphism tools required for classification results.

References

There are however many basic questions and theory-building tasks left open already for finite-domain valued PCSPs: to incorporate the trivial reduction as in e.g. \cref{ex:crips-vs-valued}; to characterize gadget reductions (or versions of definability) in terms of polymorphisms or plurimorphisms; to characterize plurimorphism valued minions of templates; to clarify whether plurimorphisms are necessary to determine computational complexity or enough information is provided already by polymorphisms; to develop methods for proving nonexistence of homomorphisms; to revisit the valued CSP dichotomy without fixed threshold and Raghavendra's result on unique games hardness of approximation for all MaxCSPs; among others. An interesting special case for a full complexity classification is the valued non-promise CSPs with fixed threshold.

The Rise of Plurimorphisms: Algebraic Approach to Approximation (2401.15186 - Barto et al., 26 Jan 2024) in Conclusion