Related papers: Combinatorics of the double-dimer model

Pandharipande-Thomas theory and Donaldson-Thomas theory (PT and DT) are two branches of enumerative geometry in which particular generating functions arise that count plane-partition-like objects. That these generating functions differ only…

A conformal partition function ${\cal P}_n^m(s)$, which arose in the theory of Diophantine equations supplemented with additional restrictions, is concerned with {\it self-dual symmetric polynomials} -- reciprocal ${\sf R}^{\{m\}}_ {S_n}$…

We propose the Kazakov-Migdal model on graphs and show that, when the parameters of this model are appropriately tuned, the partition function is represented by the unitary matrix integral of an extended Ihara zeta function, which has a…

We examine an identity originally stated in Ramanujan's ``lost notebook'' and first proven algebraically by Andrews and combinatorially by Kim. We give two independent combinatorial proofs and interpretations of this identity, which also…

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…

We characterize the generating function of bipartite planar maps counted according to the degree distribution of their black and white vertices. This result is applied to the solution of the hard particle and Ising models on random planar…

We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic boundary conditions, i.e. a graph $\Gamma$ in the Klein bottle $K$. Let $\Gamma_{mn}$ denote the graph obtained by pasting $m$ rows and $n$…

In our previous paper, we determined a unified combinatorial framework to look at a large number of colored partition identities, and studied the five identities corresponding to the exceptional modular equations of prime degree of the…

We design a recursive algorithm to compute the partition function of the Ising model, summed over cubic maps with fixed size and genus. The algorithm runs in polynomial time, which is much faster than methods based on a Tutte-like, or…

We present a particular connection between classical partition combinatorics and the theory of quiver representations. Specifically, we give a bijective proof of an analogue of A. L. Cauchy's Durfee square identity to multipartitions. We…

In this paper, we give a polynomial-time algorithm for deciding whether an input bipartite graph admits a 2-layer fan-planar drawing, resolving an open problem posed in several papers since 2015.

We state a combinatorial optimization problem whose feasible solutions define both a decomposition and a node labeling of a given graph. This problem offers a common mathematical abstraction of seemingly unrelated computer vision tasks,…

We study a linear map on symmetric functions that ``divides'' a partition by a positive integer $k$, sending a Schur function indexed by a partition of $kn$ to a symmetric function indexed by partitions of $n$. We determine its Schur…

We propose a geometric counterpart of the dimer model on bipartite graphs. A state of our model consists of a choice of a point for each white vertex and hyperplane for each black vertex. This data is subject to certain conditions…

We prove a family of factorization formulas for the combinatorial Donaldson--Thomas invariant for an acyclic quiver. A quantum dilogarithm identity due to Reineke, later interpreted by Rimanyi by counting codimensions of quiver loci, gives…

Isoradial dimer models were introduced in \cite{Kenyon3} - they consist of dimer models whose underlying graph satisfies a simple geometric condition, and whose weight function is chosen accordingly. In this paper, we prove a conjecture of…

In 1984, Bressoud and Subbarao obtained an interesting weighted partition identity for a generalized divisor function, by means of combinatorial arguments. Recently, the last three named authors found an analytic proof of the aforementioned…

In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…

We give a new proof of a partition theorem popularly known as Elder's theorem, but which is also credited to Stanley and Fine. We extend the theorem to the context of colored partitions (or prefabs). More specifically, we give analogous…

The aim of this paper is to develop the combinatorics of constructions associated to what we call \emph{triangular partitions}. As introduced in arXiv:2102.07931, these are the partitions whose cells are those lying below the line joining…