From Holant to #CSP and Back: Dichotomy for Holantc Problems

We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-colorings. We consider these problems for general complex valued functions that take boolean inputs. We show that results from one framework can be used to derive results in another, and this happens in both directions. Holographic reductions discover an underlying unity, which is only revealed when these counting problems are investigated in the complex domain ℂ. We prove three complexity dichotomy theorems, leading to a general theorem for Holantc problems. This is the natural class of Holant problems where one can assign constants 0 or 1. More specifically, given any signature grid on G=(V,E) over a set [inline-graphic not available: see fulltext] of symmetric functions, we completely classify the complexity to be in P or #P-hard, according to [inline-graphic not available: see fulltext], of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sum_{\sigma: E \rightarrow \{0,1\}}\prod_{v\in V} f_v(\sigma \vert _{E(v)}),$$\end{document} where [inline-graphic not available: see fulltext] (0, 1 are the unary constant 0, 1 functions). Not only is holographic reduction the main tool, but also the final dichotomy can be only naturally stated in the language of holographic transformations. The proof goes through another dichotomy theorem on Boolean complex weighted #CSP.