Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Bipartite 3-Regular Counting Problems with Mixed Signs   We prove a complexity dichotomy for a class of counting problems expressible
as bipartite 3-regular Holant problems. For every problem of the form
$\operatorname{Holant}\left(f\mid =_3 \right)$, where $f$ is any integer-valued
ternary symmetric constraint function on Boolean variables, we prove that it is
either P-time computable or #P-hard, depending on an explicit criterion of $f$.
The constraint function can take both positive and negative values, allowing
for cancellations. The dichotomy extends easily to rational valued functions of
the same type. In addition, we discover a new phenomenon: there is a set
$\mathcal{F}$ with the property that for every $f \in \mathcal{F}$ the problem
$\operatorname{Holant}\left(f\mid =_3 \right)$ is planar P-time computable but
#P-hard in general, yet its planar tractability is by a combination of a
holographic transformation by $\left[\begin{smallmatrix} 1 & 1 \\ 1 & -1
\end{smallmatrix}\right]$ to FKT together with an independent global argument.

25
The categories of this paper are: patt-sol
35
The categories of this paper are: mtrl-th
9
The categories of this paper are: nlin
14
The categories of this paper are: math-ph
23
The categories of this paper are: solv-int
16
The categories of this paper are: stat
26
The categories of this paper are: bayes-an
24
The categories of this paper are: dg-ga
31
The categories of this paper are: ao-sci
32
The categories of this paper are: atom-ph
13
The categories of this paper are: quant-ph
17
The categories of this paper are: q-fin
5
The categories of this paper are: gr-qc
10
The categories of this paper are: q-bio
30
The categories of this paper are: q-alg
28
The categories of this paper are: alg-geom