Holant* Dichotomy on Domain Size 3: A Geometric Perspective

2025-04-18

AI Summary

This work resolves the exact computational complexity classification of Holant* problems over symmetric real-valued constraint functions on a ternary domain (domain size 3). We establish the first complete dichotomy theorem for this setting: every such problem is either solvable in polynomial time (P) or #P-hard, with no intermediate complexity. Our core methodological innovation lies in deeply integrating tensor geometric structure into complexity analysis—specifically, the geometric decomposition properties of constraint functions directly determine tractability boundaries. To achieve this, we combine advanced techniques including tensor decomposition, algebraic geometry, symmetric function theory, modular reduction, and interpolation. The result is an explicit, necessary and sufficient tractability criterion expressed purely in terms of the geometric characteristics of the constraint functions. This yields the first full complexity classification for Holant* problems over domain size 3, settling a long-standing open problem in counting complexity.

Technology Category

• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Machine Learning: Matrix & Tensor Methods

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Security and Privacy: Large-scale security measurements

Abstract

Holant problems are a general framework to study the computational complexity of counting problems. It is a more expressive framework than counting constraint satisfaction problems (CSP) which are in turn more expressive than counting graph homomorphisms (GH). In this paper, we prove the first complexity dichotomy of $mathrm{Holant}_3(mathcal{F})$ where $mathcal{F}$ is an arbitrary set of symmetric, real valued constraint functions on domain size $3$. We give an explicit tractability criterion and prove that, if $mathcal{F}$ satisfies this criterion then $mathrm{Holant}_3(mathcal{F})$ is polynomial time computable, and otherwise it is #P-hard, with no intermediate cases. We show that the geometry of the tensor decomposition of the constraint functions plays a central role in the formulation as well as the structural internal logic of the dichotomy.

Problem

• Dichotomy for Holant problems on domain size 3
• Tractability criterion for symmetric real-valued constraints
• Role of tensor decomposition geometry in complexity

Innovation

• Geometric tensor decomposition for complexity analysis
• Polynomial time tractability criterion for Holant3
• Dichotomy between P-time and #P-hard cases