Related papers: Combinatorics of the double-dimer model
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
We present a new partition identity and give a combinatorial proof of our result. This generalizes a result of Andrew's in which he considers the generation function for partitions with respect to size, number of odd parts, and number of…
Dominators provide a general mechanism for identifying reconverging paths in graphs. This is useful for a number of applications in Computer-Aided Design (CAD) including signal probability computation in biased random simulation, switching…
Working within the path-integral framework we first establish a duality between the partion functions of two $U(1)$ gauge theories with a theta term in $d=4$ space-time dimensions. Then, after a dimensional reduction to $d=3$ dimensions we…
We give a new proof of Chan's identity involving the cubic partition function and we also give a new identity for the cubic partition function which is analogues to the Zuckerman's identity for the ordinary partition function.
We prove that the slice rank of a 3-tensor (a combinatorial notion introduced by Tao in the context of the cap-set problem), the analytic rank (a Fourier-theoretic notion introduced by Gowers and Wolf), and the geometric rank (an…
Dilogarithm identities for the central charges and conformal dimensions exist for at least large classes of rational conformally invariant quantum field theories in two dimensions. In many cases, proofs are not yet known but the numerical…
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems,…
Motivated by M-theory, we study rank n K-theoretic Donaldson-Thomas theory on a toric threefold X. In the presence of compact four-cycles, we discuss how to include the contribution of D4-branes wrapping them. Combining this with a simple…
We propose a framework for bilinear multiplier operators defined via the (bivariate) spectral theorem. Under this framework we prove Coifman-Meyer type multiplier theorems and fractional Leibniz rules. Our theory applies to bilinear…
A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…
We revisit the problem of hard particles on planar random tetravalent graphs in view of recent combinatorial techniques relating planar diagrams to decorated trees. We show how to recover the two-matrix model solution to this problem in…
Using a specific form of the triple product identity, polygonal number identities are stated. Further number identities are examined that can be considered identities related to modular sets of numbers. The identities can be used to give…
In the first part of the paper, we classify linear integrable (multi-dimensionally consistent) quad-equations on bipartite isoradial quad-graphs in $\mathbb C$, enjoying natural symmetries and the property that the restriction of their…
Roe's partitioned manifold index theorem applies when a complete Riemannian manifold $M$ is cut into two pieces along a compact hypersurface $N$. It states that a version of the index of a Dirac operator on $M$ localized to $N$ equals the…
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of discrete convex analysis by Murota, and is motivated by…
We establish power saving asymptotics for the sum of the divisor function along a binary quartic form, improving on work of Daniel. The proof involves an application of a recent two dimensional delta method due to Li, Rydin-Myerson, and…
A technique called graphical condensation is used to prove various combinatorial identities among numbers of (perfect) matchings of planar bipartite graphs and tilings of regions. Graphical condensation involves superimposing matchings of a…
Dimer models (also known as brane tilings) are special bipartite graphs on a torus $\mathbb{T}^2$. They encode the structure of the 4d $\mathcal{N} = 1$ worldvolume theories of D3 branes probing toric affine Calabi-Yau singularities.…
Introduced by Goulden and Jackson in their 1996 paper, the matchings-Jack conjecture and the hypermap-Jack conjecture (also known as the $b$-conjecture) are two major open questions relating Jack symmetric functions, the representation…