Holant Problems for 3-Regular Graphs with Complex Edge Functions

Abstract

We prove a complexity dichotomy theorem for Holant problems on 3-regular graphs with an arbitrary complex-valued edge function. Three new techniques are introduced: (1) higher dimensional iterations in interpolation; (2) Eigenvalue Shifted Pairs, which allow us to prove that a pair of combinatorial gadgets in combination succeed in proving #P-hardness; and (3) algebraic symmetrization, which significantly lowers the symbolic complexity of the proof for computational complexity. Using holographic reductions the classification theorem also applies to problems beyond the basic model.