Related papers: Combinatorics of the double-dimer model

We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…

This article proves that an irreducible subfactor planar algebra with a distributive biprojection lattice admits a minimal 2-box projection generating the identity biprojection. It is a generalization (conjectured in 2013) of a theorem of…

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…

In 1980, Bressoud conjectured a combinatorial identity $A_j=B_j$ for $j=0$ or $1$, where the function $A_j$ counts the number of partitions with certain congruence conditions and the function $B_j$ counts the number of partitions with…

We show that the two binary operations in double inverse semigroups, as considered by Kock [2007], necessarily coincide.

We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…

Plane partition diamonds were introduced by Andrews, Paule, and Riese (2001) as part of their study of MacMahon's $\Omega$-operator in search for integer partition identities. More recently, Dockery, Jameson, Sellers, and Wilson (2024)…

The exact solution of a system of bilinear identities derived in the first part of our work [Nucl.Phys.A 938 (2015) 59] for the case of real Grassmann-odd tensor aggregate of the type $(S,V_{\mu},\!\,^{\ast}T_{\mu \nu},A_{\mu}, P)$ is…

The goal of this paper is to exhibit a deep relation between the partition function of the Ising model on a planar trivalent graph and the generating series of the spin network evaluations on the same graph. We provide respectively a…

In this paper we take some classical ideas from commutative algebra, mostly ideas involving duality, and apply them in algebraic topology. To accomplish this we interpret properties of ordinary commutative rings in such a way that they can…

In this paper, by applying a range of classic summation and transformation formulas for basic hypergeometric series, we obtain a three-term identity for partial theta functions. It extends the Andrews-Warnaar partial theta function…

The Rogers-Ramanujan-Gordon identities generalize the classical partition identities discovered independently by L. J. Rogers and S. Ramanujan. In 2021, Afsharijoo provided a commutative algebra proof of the Rogers-Ramanujan-Gordon…

We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…

In the recursive lamination of the disk, one tries to add chords one after another at random; a chord is kept and inserted if it does not intersect any of the previously inserted ones. Curien and Le Gall [Ann. Probab. 39 (2011) 2224-2270]…

In this note, we find a combinatorial identity which is closely related to the multi-dimensional integral $\gamma_{m}$ in the study of divisor functions. As an application, we determine the finite dual of the group algebra of infinite…

We consider the monomer-dimer partition function on arbitrary finite planar graphs and arbitrary monomer and dimer weights, with the restriction that the only non-zero monomer weights are those on the boundary. We prove a Pfaffian formula…

We obtain a unification of two refinements of Euler's partition theorem respectively due to Bessenrodt and Glaisher. A specialization of Bessenrodt's insertion algorithm for a generalization of the Andrews-Olsson partition identity is used…

In his paper, "On a Partition Function of Richard Stanley," George Andrews proves a certain partition identity analytically and asks for a combinatorial proof. This paper provides the requested combinatorial proof.

We introduce Riemann-Hilbert problems determined by refined Donaldson-Thomas theory. They involve piecewise holomorphic maps from the complex plane to the group of automorphisms of a quantum torus algebra. We study the simplest case in…

One of the most basic results concerning the number-theoretic properties of the partition function $p(n)$ is that $p(n)$ takes each value of parity infinitely often. This statement was first proved by Kolberg in 1959, and it was…