← 研踪 PaperTrailarXiv:2611.24236 · v1
From a finite subgroup of $SO(3)$:$C_2$ leads to a Holant dichotomy
首次提交 2026-11-18 19:13
版本更新 2026-11-18 19:13
雷达观测 2026-11-19 15:04
摘要
Counting complexity within the Holant framework has been extensively studied through complexity dichotomy theorems. While substantial progress has been achieved for various restricted settings, the general complex-valued even-arity case without auxiliary unary signatures remains largely open. This paper studies a fundamental case in this program where the binary signatures induce a group structure satisfying . It is observed that projective equivalence classes of binary signature matrices naturally embed into finite subgroups of , providing an algebraic viewpoint for structural classification. This paper further identifies two fundamentally different regimes for the case, namely the normal and isotropic cases, and analyzes their complexity behavior separately. Combining gadget constructions, decomposition techniques, interpolation arguments, and a realnumberization approach that transforms the complex-valued setting into an equivalent real-structured framework, this paper establishes a complete dichotomy theorem: for every even-arity signature set satisfying \(M(\B(\mathcal{F}))\cong C_2\), the problem is either polynomial-time computable or \#P-hard. A Pauli-basis representation for signatures is further introduced as an algebraically natural language for organizing realizable signatures and revealing structural relations that are less transparent in the standard basis.
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-18 19:13 · 最新观测版本
From a finite subgroup of $SO(3)$:$C_2$ leads to a Holant dichotomy
Counting complexity within the Holant framework has been extensively studied through complexity dichotomy theorems. While substantial progress has been achieved for various restricted settings, the general complex-valued even-arity case without auxiliary unary signatures remains largely open. This paper studies a fundamental case in this program where the binary signatures induce a group structure satisfying . It is observed that projective equivalence classes of binary signature matrices naturally embed into finite subgroups of , providing an algebraic viewpoint for structural classification. This paper further identifies two fundamentally different regimes for the case, namely the normal and isotropic cases, and analyzes their complexity behavior separately. Combining gadget constructions, decomposition techniques, interpolation arguments, and a realnumberization approach that transforms the complex-valued setting into an equivalent real-structured framework, this paper establishes a complete dichotomy theorem: for every even-arity signature set satisfying \(M(\B(\mathcal{F}))\cong C_2\), the problem is either polynomial-time computable or \#P-hard. A Pauli-basis representation for signatures is further introduced as an algebraically natural language for organizing realizable signatures and revealing structural relations that are less transparent in the standard basis.
查看此版本解读 →查看此版本原文 ↗