Related papers: Combinatorics of the double-dimer model
The dimer model is the study of random dimer covers (perfect matchings) of a graph. A double-dimer configuration on a graph $G$ is a union of two dimer covers of $G$. We introduce quaternion weights in the dimer model and show how they can…
We give combinatorial proofs of two identities from the representation theory of the partition algebra $C A_k(n), n \ge 2k$. The first is $n^k = \sum_\lambda f^\lambda m_k^\lambda$, where the sum is over partitions $\lambda$ of $n$,…
We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…
In this work, we give combinatorial proofs for generating functions of two problems, i.e., flushed partitions and concave compositions of even length. We also give combinatorial interpretation of one problem posed by Sylvester involving…
Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…
Recently, it is well known that the conjectural integral identity is of crucial importance in the motivic Donaldson-Thomas invariants theory for non-commutative Calabi-Yau threefolds. The purpose of this article is to consider different…
We introduce a class of graphs called compound graphs, generalizing rectangles, which are constructed out of copies of a planar bipartite base graph. The main result is that the number of perfect matchings of every compound graph is…
We study the supersymmetric partition function of a 2d linear $\sigma$-model whose target space is a torus with a complex structure that varies along one worldsheet direction and a K\"ahler modulus that varies along the other. This setup is…
We derive two multivariate generating functions for three-dimensional Young diagrams (also called plane partitions). The variables correspond to a colouring of the boxes according to a finite Abelian subgroup G of SO(3). We use the vertex…
In this paper we propose and realize (the code is publicly available at https://github.com/Thrawn1985/2D-Partition-Function) an algorithm for exact calculation of partition function for planar graph models with binary spins. The complexity…
Recently, Andrews and Yee studied two-variable generalizations of two identities involving partition functions $p_\omega(n)$ and $p_\nu(n)$ introduced by Andrews, Dixit and Yee. In this paper, we present a combinatorial proof of an…
We set up a combinatorial framework for inclusion-exclusion on the partitions into distinct parts to obtain an alternative generating function of partitions into distinct and non-consecutive parts. In connection with Rogers-Ramanujan…
We study the Riemann-Hilbert problems associated to the Donaldson-Thomas theory of the resolved conifold. We give explicit solutions in terms of the Barnes double and triple sine functions. We show that the corresponding tau function is a…
In this paper, we prove a window theorem for categorical Donaldson-Thomas theories on local surfaces as an analogue of window theorem for GIT quotient stacks. We give two applications of our main result. The first one is a proof of…
Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behind it is a combinatorial lemma of Robertson, Seymour and…
In 2016 Bessenrodt--Ono discovered an inequality addressing additive and multiplicative properties of the partition function. Generalization by several authors have been given; on partitions with rank in a given residue class by…
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdos and Renyi about perfect matchings in random bipartite graphs.…
We define and study a recurrence relation in ${\mathbb Z}^3$, called the hexahedron recurrence, which is similar to the octahedron recurrence (Hirota bilinear difference equation) and cube recurrence (Miwa equation). Like these examples,…
We prove a duality theorem applicable to a a wide range of specialisations, as well as to some generalisations, of tangles in graphs. It generalises the classical tangle duality theorem of Robertson and Seymour, which says that every graph…
We continue our analysis of bad theories, focusing on quiver theories with bad unitary and special unitary gauge groups in three dimensions. By extending the dualization algorithm we prove that the partition function of bad linear quivers…