Related papers: Approximating Holant problems by winding
We study the complexity of approximating the number of answers to a small query $\varphi$ in a large database $\mathcal{D}$. We establish an exhaustive classification into tractable and intractable cases if $\varphi$ is a conjunctive query…
We consider massless Dirac operators on the half-line with compactly supported potentials. We solve the inverse problems in terms of Jost function and scattering matrix (including characterization). We study resonances as zeros of Jost…
Motivated by a common Mathematical Finance topic, we discuss the reciprocal of the exit time from a cone of planar Brownian motion which also corresponds to the exponential functional of an associated Brownian motion. We prove a conjecture…
For combinatorial optimization problems that can be formulated as Ising or Potts spin systems, the Mean Field (MF) approximation yields a versatile and simple ANN heuristic, Deterministic Annealing. For assignment problems the situation is…
We prove a complexity dichotomy theorem for Holant problems over an arbitrary set of complex-valued symmetric constraint functions F on Boolean variables. This extends and unifies all previous dichotomies for Holant problems on symmetric…
We lift the constraint of a diagonal representation of the Hamiltonian by searching for square integrable bases that support a tridiagonal matrix representation of the wave operator. Doing so results in exactly solvable problems with a…
In the framework of a real Hilbert space we consider the problem of approaching solutions to a class of hierarchical variational inequality problems, subsuming several other problem classes including certain mathematical programs under…
We aim to create the highest possible quality of treatment-control matches for categorical data in the potential outcomes framework. Matching methods are heavily used in the social sciences due to their interpretability, but most matching…
We study the approximability of the four-vertex model, a special case of the six-vertex model.We prove that, despite being NP-hard to approximate in the worst case, the four-vertex model admits a fully polynomial randomized approximation…
Holant problems are a general framework to study the algorithmic complexity of counting problems. Both counting constraint satisfaction problems and graph homomorphisms are special cases. All previous results of Holant problems are over the…
We define and explore a notion of unique prime factorization for constraint functions, and use this as a new tool to prove a complexity classification for counting weighted Eulerian orientation problems with arrow reversal symmetry (ARS).…
$\operatorname{Holant}^*(f)$ denotes a class of counting problems specified by a constraint function $f$. We prove complexity dichotomy theorems for $\operatorname{Holant}^*(f)$ in two settings: (1) $f$ is any arity-3 real-valued function…
Holographic algorithms introduced by Valiant are composed of two ingredients: matchgates, which are gadgets realizing local constraint functions by weighted planar perfect matchings, and holographic reductions, which show equivalences among…
Valiant's Holant theorem is a powerful tool for algorithms and reductions for counting problems. It states that if two sets $\mathcal{F}$ and $\mathcal{G}$ of tensors (a.k.a. constraint functions or signatures) are related by a…
A set of solver-free heuristics for the offshore wind collection system problem are presented. Currently, methods of this type are not able to cope with typical constraints, and most of their variations minimize only for accumulated cable…
Analytic continuation problems are notoriously ill-posed without additional regularizing constraints, even though every analytic function has a rigidity property of unique continuation from every curve inside the domain of analyticity. In…
Fibonacci gate problems have severed as computation primitives to solve other problems by holographic algorithm and play an important role in the dichotomy of exact counting for Holant and CSP frameworks. We generalize them to weighted…
In this work, building up on [1] we present momentum space Ward identities related to broken higher spin symmetry as an alternate approach to computing correlators of spinning operators in interacting theories such as the quasi-fermionic…
We explore the clearing problem in the barter exchange market. The problem, described in the terminology of graph theory, is to find a set of vertex-disjoint, length-restricted cycles that maximize the total weight in a weighted digraph.…
Non-trivial analysis problems require posets with infinite ascending and descending chains. In order to compute reasonably precise post-fixpoints of the resulting systems of equations, Cousot and Cousot have suggested accelerated fixpoint…