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

Axiomatization of plurimorphism valued minions

Characterize the valued minion Plu(A,B) associated with a valued promise template (A,B), giving an explicit axiomatization (closure rules and structural properties) that uniquely determine the class of plurimorphisms.

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

Background

While plurimorphisms play a central role in the reduction theorem, their global structure as a valued minion is not yet axiomatized. An axiomatization would clarify which operations and combinations must be included and how minors and convexity interact.

This would parallel the crisp setting’s minion theory and enable sharper homomorphism and nonexistence arguments.

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