Related papers: Approximating Holant problems by winding

We develop the technique of weight truncation in the context of wall-crossings in birational cobordisms, parallel to that in [HL15, BFK19]. More precisely, for each such wall-crossing, we embed the bounded above derived category of coherent…

This paper proves the NP-completeness of the reachability problem for the class of flat counter machines with difference bounds and, more generally, octagonal relations, labeling the transitions on the loops. The proof is based on the fact…

We revisit the feasibility approach to the construction of compactly supported smooth orthogonal wavelets on the line. We highlight its flexibility and illustrate how symmetry and cardinality properties are easily embedded in the design…

We investigate the computational difficulty of approximating the partition function of the ferromagnetic Ising model on a regular matroid. Jerrum and Sinclair have shown that there is a fully polynomial randomised approximation scheme…

In many combinatorial problems one may need to model the diversity or similarity of assignments in a solution. For example, one may wish to maximise or minimise the number of distinct values in a solution. To formulate problems of this…

Correspondence is a ubiquitous problem in computer vision and graph matching has been a natural way to formalize correspondence as an optimization problem. Recently, graph matching solvers have included higher-order terms representing…

Holant problems capture a class of Sum-of-Product computations such as counting matchings. It is inspired by holographic algorithms and is equivalent to tensor networks, with counting CSP being a special case. A classification for Holant…

In this paper, we almost completely solve the existence of an almost resolvable cycle system with odd cycle length. We also use almost resolvable cycle systems as well as other combinatorial structures to give some new solutions to the…

We investigate a system of Brownian particles weakly bound by attractive parity-symmetric potentials that grow at large distances as $V(x) \sim |x|^\alpha$, with $0 < \alpha < 1$. The probability density function $P(x,t)$ at long times…

Valiant introduced matchgate computation and holographic algorithms. A number of seemingly exponential time problems can be solved by this novel algorithmic paradigm in polynomial time. We show that, in a very strong sense, matchgate…

We prove complex contraction for zero-free regions of counting weighted set cover problem in which an element can appear in an unbounded number of sets, thus obtaining fully polynomial-time approximation schemes(FPTAS) via Barvinok's…

We determine the complexity of several constraint satisfaction problems using the heuristic algorithm, WalkSAT. At large sizes N, the complexity increases exponentially with N in all cases. Perhaps surprisingly, out of all the models…

This paper tackles the problem of the existence of solutions for recursive systems of Horn clauses with second-order variables interpreted as integer relations, and harnessed by quantifier-free difference bounds arithmetic. We start by…

We propose to extend ``invertibility'' to ``regularity'' for categories in general abstract algebraic manner. Higher regularity conditions and ``semicommutative'' diagrams are introduced. Distinction between commutative and…

Algorithmic fairness involves expressing notions such as equity, or reasonable treatment, as quantifiable measures that a machine learning algorithm can optimise. Most work in the literature to date has focused on classification problems…

We prove a complexity classification theorem that classifies all counting constraint satisfaction problems ($\#$CSP) over Boolean variables into exactly three categories: (1) Polynomial-time tractable; (2) $\#$P-hard for general instances,…

The explicit form of conformal generators is found which provides the extension of Poincare symmetry for massless particles of arbitrary helicity. The helicity 1/2 particles are considered as the particular example. The realization of…

We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of rounding techniques yield novel and powerful ways of rounding.…

The complex eigenvalues of Markov generators govern oscillatory properties of relaxation, autocorrelation, and linear response. Here we show that these eigenvalues are localized by nonequilibrium cycles of the generator, thus revealing a…

We introduce Gowers--Matet forcing with a finite sequence of pairwise non-isomorphic Ramsey ultrafilters over $\omega$, and with this forcing we settle the long-standing problem of the spectrum of numbers near-coherence classes. We prove…