Related papers: A complexity dichotomy for partition functions wit…
Subgraph counting is a fundamental and well-studied problem whose computational complexity is well understood. Quite surprisingly, the hypergraph version of subgraph counting has been almost ignored. In this work, we address this gap by…
The Dichotomy Conjecture for constraint satisfaction problems (CSPs) states that every CSP is in P or is NP-complete (Feder-Vardi, 1993). It has been verified for conservative problems (also known as list homomorphism problems) by A.…
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…
$W$-representation realizes partition functions by an action of a cut-and-join-like operator on the vacuum state with a zero-mode background. We provide explicit formulas of this kind for $\beta$- and $q,t$-deformations of the simplest…
One of the driving problems in the CSP area is the Dichotomy Conjecture, formulated in 1993 by Feder and Vardi [STOC'93], stating that for any fixed relational structure G the Constraint Satisfaction Problem CSP(G) is either NP--complete or…
Probabilistic graphical models have emerged as a powerful modeling tool for several real-world scenarios where one needs to reason under uncertainty. A graphical model's partition function is a central quantity of interest, and its…
We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…
In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this…
We consider a family of quantum spin systems which includes as special cases the ferromagnetic XY model and ferromagnetic Ising model on any graph, with or without a transverse magnetic field. We prove that the partition function of any…
Motivated by string theory connection, a covariant procedure for perturbative calculation of the partition function of the two-dimensional generalized $\sigma$-model is considered. The importance of a consistent regularization of the…
Graph partitioning is a key fundamental problem in the area of big graph computation. Previous works do not consider the practical requirements when optimizing the big data analysis in real applications. In this paper, motivated by…
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…
The symmetric group $\mathsf{S}_n$ and the partition algebra $\mathsf{P}_k(n)$ centralize one another in their actions on the $k$-fold tensor power $\mathsf{M}_n^{\otimes k}$ of the $n$-dimensional permutation module $\mathsf{M}_n$ of…
This paper deals with analytic families of holomorphic iterated function systems. Using real analyticity of the pressure function (which we prove), we establish a classification theorem for analytic families of holomorphic iterated function…
We investigate the complexity of generalizations of colourings (acyclic colourings, $(k,\ell)$-colourings, homomorphisms, and matrix partitions), for the class of transitive digraphs. Even though transitive digraphs are nicely structured,…
We prove that the partition function for tripartite double-dimer configurations of a planar bipartite graph satisfies a recurrence related to the Desnanot-Jacobi identity from linear algebra. A similar identity for the dimer partition…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
In this paper we propose and realize (the code is publicly available at https://github.com/Thrawn1985/2D-Partition-Function) an algorithm for exact calculation of partition function for planar graph models with binary spins. The complexity…
Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…
We characterize which graph invariants are partition functions of a spin model over the complex numbers, in terms of the rank growth of associated `connection matrices'.