Related papers: The Complexity of Partition Functions on Hermitian…
$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 most important recent developments in the complexity of approximate counting is the classification of the complexity of approximating the partition functions of antiferromagnetic 2-spin systems on bounded-degree graphs. This…
We summarize the recent results about complete solvability of Hermitian and rectangular complex matrix models. Partition functions have very simple character expansions with coefficients made from dimensions of representation of the linear…
We study the complexity of graph problems on graphs defined on groups, especially power graphs. We observe that an isomorphism invariant problem, such as Hamiltonian Path, Partition into Cliques, Feedback Vertex Set, Subgraph Isomorphism,…
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'.
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
In Part 1 we study the spherical functions on compact symmetric pairs of arbitrary rank under a suitable multiplicity freeness assumption and additional conditions on the branching rules. The spherical functions are taking values in the…
The complexity of graph homomorphism problems has been the subject of intense study. It is a long standing open problem to give a (decidable) complexity dichotomy theorem for the partition function of directed graph homomorphisms. In this…
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…
Let $X_1, \ldots, X_n$ be probability spaces, let $X$ be their direct product, let $\phi_1, \ldots, \phi_m: X \longrightarrow {\Bbb C}$ be random variables, each depending only on a few coordinates of a point $x=(x_1, \ldots, x_n)$, and let…
We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…
We present a numerical method to evaluate partition functions and associated correlation functions of inhomogeneous 2--D classical spin systems and 1--D quantum spin systems. The method is scalable and has a controlled error. We illustrate…
The partition functions of Hermitian one-matrix models are known to be tau-functions of the KP hierarchy. In this paper we explicitly compute the elements in Sato grassmannian these tau-functions correspond to, and use them to compute the…
For a generic value of the central charge, we prove the holomorphic factorization of partition functions for free superconformal fields which are defined on a compact Riemann surface without boundary. The partition functions are viewed as…
We consider the complexity of counting weighted graph homomorphisms defined by a symmetric matrix $A$. Each symmetric matrix $A$ defines a graph homomorphism function $Z_A(\cdot)$, also known as the partition function. Dyer and Greenhill…
The computation of the partition function in certain quantum field theories, such as those of the Argyres-Douglas or Minahan-Nemeschansky type, is problematic due to the lack of a Lagrangian description. In this paper, we use the…
Let $\cal{N}=\{1,\cdots,n\}$. The entropy function $\bf h$ of a set of $n$ discrete random variables $\{X_i:i\in\cal N\}$ is a $2^n$-dimensional vector whose entries are ${\bf{h}}({\cal{A}})\triangleq H(X_{\cal{A}}),\cal{A}\subset{\cal N}…
We provide evidence that it is computationally difficult to approximate the partition function of the ferromagnetic q-state Potts model when q>2. Specifically we show that the partition function is hard for the complexity class #RHPi_1…
In this paper we investigate certain fusion relations associated to an integrable vertex model on the square lattice which is invariant under $Sp(4)$ symmetry. We establish a set of functional relations which include a transfer matrix…
We discover new P-time computable six-vertex models on planar graphs beyond Kasteleyn's algorithm for counting planar perfect matchings. We further prove that there are no more: Together, they exhaust all P-time computable six-vertex models…