Related papers: A Pfaffian formula for monomer-dimer partition fun…
Let $\mathcal F$ be either the set of all bounded holomorphic functions or the set of all $m$-homogeneous polynomials on the unit ball of $\ell\_r$. We give a systematic study of the sets of all $u\in\ell\_r$ for which the monomial…
The Euler theorem in partition theory and its generalization are derived from a non-interacting quantum field theory in which each bosonic mode with a given frequency is equivalent to a sum of bosonic mode whose frequency is twice…
We give an FPTAS for approximating the partition function of the hard-core model for bipartite graphs when there is sufficient imbalance in the degrees or fugacities between the sides $(L,R)$ of the bipartition. This includes, among others,…
We formalize algorithms computing Pfaffian in the theory of bounded arithmetic for sharpL which is based on Berkowitz algorithm for the determinant. We also prove relations among Pfaffian properties. Furthermore, we give an algorithm for…
The study of complexity measures of Boolean functions led Nisan and Szegedy to state the sensitivity conjecture in 1994, claiming a polynomial relation between degree and sensitivity. This problem remained unsolved until 2019, when Huang…
We prove an Alt-Caffarelli-Friedman montonicity formula for pairs of functions solving elliptic equations driven by different ellipticity matrices in their positivity sets. As application, we derive Liouville-type theorems for subsolutions…
We define transgressions of arbitrary order, with respect to families of unit-vector fields indexed by a polytope, for the Pfaffian of metric connections for semi-Riemannian metrics on vector bundles. We apply this formula to compute the…
Szemer\'edi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that…
In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…
We discuss the supersymmetric formulation of the nonhermitian $\beta = 2$ random matrix partition function with one bosonic flavor. This partition function is regularized by adding one conjugate boson and fermion each. A supersymmetric…
This paper lies in the context of the studies of eigenfunctions of graphs having minimum cardinality of support. One of the tools is the weight-distribution bound, a lower bound on the cardinality of support of an eigenfunction of a…
We derive one-point functions of the loop operators of Hermitian matrix-chain models at finite $N$ in terms of differential operators acting on the partition functions. The differential operators are completely determined by recursion…
We give an elementary algebraic proof of Paradan's wall crossing formulae for partition functions. We also express such jumps in volume and partition functions by one dimensional residue formulae. Subsequently we reprove the relation…
We construct a stationary density functional for the partition function from a chosen set of one (boson) line irreducible Feynman diagrams. The construction does not proceed by the inversion of a Legendre transform. It is formulated for…
We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.
The exactly solvable four-vertex model with the fixed boundary conditions in the presence of inhomogeneous linearly growing external field is considered. The partition function of the model is calculated and represented in the determinantal…
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…
We extend the planar Pfaffian formalism for the evaluation of the Ising partition function to lattices of high topological genus g. The 3D Ising model on a cubic lattice, where g is proportional to the number of sites, is discussed in…
We prove that the class of cluster integrable systems constructed by Goncharov and Kenyon out of the dimer model on a torus coincides with the one defined by Gekhtman, Shapiro, Tabachnikov, and Vainshtein using Postnikov's perfect networks.…
In this paper, we explain a connection between a family of free-fermionic six-vertex models and a discrete time evolution operator on one-dimensional Fermionic Fock space. The family of ice models generalize those with domain wall boundary,…