Related papers: The Complexity of Partition Functions on Hermitian…
Partitions of unity in ${\mathbf R}^d$ formed by (matrix) scales of a fixed function appear in many parts of harmonic analysis, e.g., wavelet analysis and the analysis of Triebel-Lizorkin spaces. We give a simple characterization of the…
We prove a complexity dichotomy theorem for the eight-vertex model. For every setting of the parameters of the model, we prove that computing the partition function is either solvable in polynomial time or \#P-hard. The dichotomy criterion…
We consider spaces for which there is a notion of harmonicity for complex valued functions defined on them. For instance, this is the case of Riemannian manifolds on one hand, and (metric) graphs on the other hand. We observe that it is…
Spin glasses are fundamental probability distributions at the core of statistical physics, the theory of average-case computational complexity, and modern high-dimensional statistical inference. In the mean-field setting, we design…
New formulas are given for the grand partition function of paraboson systems of order p with n orbitals and parafermion systems of order p with m orbitals. These formulas allow the computation of statistical and thermodynamic functions for…
We construct the ($\beta$-deformed) partition function hierarchies with $W$-representations. Based on the $W$-representations, we analyze the superintegrability property and derive their character expansions with respect to the Schur…
PT-symmetric Hamiltonians and transfer matrices arise naturally in statistical mechanics. These classical and quantum models often require the use of complex or negative weights and thus fall outside of the conventional equilibrium…
This paper deals with the partition function of the Ising model from statistical mechanics, which is used to study phase transitions in physical systems. A special case of interest is that of the Ising model with constant energies and…
The probabilistic satisfiability of a logical expression is a fundamental concept known as the partition function in statistical physics and field theory, an evaluation of a related graph's Tutte polynomial in mathematics, and the…
Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…
We find a close correspondence between certain partition functions of ideal quantum gases and certain symmetric polynomials. Due to this correspondence it can be shown that a number of thermodynamic identities which have recently been…
A physically more adequate definition of a quaternionic holomorphic (H-holomorphic) function of one quaternionic variable compared to known ones and a quaternionic generalization of Cauchy-Riemann's equations are presented. At that a class…
We prove a complete complexity classification theorem for the planar eight-vertex model. For every parameter setting in ${\mathbb C}$ for the eight-vertex model, the partition function is either (1) computable in P-time for every graph, or…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
We study approximations of the partition function of dense graphical models. Partition functions of graphical models play a fundamental role is statistical physics, in statistics and in machine learning. Two of the main methods for…
We consider general fermionic quantum field theories with a global finite group symmetry $G$, focusing on the case of 2-dimensions and torus spacetime. The modular transformation properties of the family of partition functions with…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
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…
The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…
We prove a complexity dichotomy theorem for a class of Holant problems on 3-regular bipartite graphs. Given an arbitrary nonnegative weighted symmetric constraint function $f = [x_0, x_1, x_2, x_3]$, we prove that the bipartite Holant…