Related papers: MacMahon's Double Vision: Partition Diamonds Revis…
The duality between type IIA superstring theory and M-theory enables us to lift bound states of D$0$-branes and $n$ parallel D$6$-branes to M-theory compactified on an $n$-centered multi-Taub-NUT space $\mathbb{TN}_{n}$. Accordingly, the…
The conjecture that the orbit-counting generating function for totally symmetric plane partitions can be written as an explicit product formula, has been stated independently by George Andrews and David Robbins around 1983. We present a…
A triangular partition is a partition whose Ferrers diagram can be separated from its complement (as a subset of $\mathbb{N}^2$) by a straight line. Having their origins in combinatorial number theory and computer vision, triangular…
This thesis is divided into three parts. The first part deals with cylindric plane partitions. The second with lambda-determinants and the third with commutators in semi-circular systems. For more detailed abstract please see inside.…
Extending the rigorous presentation of the classical umbral calculus given by Rota and Taylor in 1994, the so-called partition polynomials are interpreted with the aim to point out the umbral nature of the Poisson random variables. Among…
We compute the instanton partition function for ${\cal N}=4$ U(N) gauge theories living on toric varieties, mainly of type $\R^4/\Gamma_{p,q}$ including $A_{p-1}$ or $O_{\PP_1}(-p)$ surfaces. The results provide microscopic formulas for the…
MacMahon proved a simple product formula for the generating function of plane partitions fitting in a given box. The theorem implies a $q$-enumeration of lozenge tilings of a semi-regular hexagon on the triangular lattice. In this paper we…
We develop a theory of the field of double Laurent series, iterated Laurent series, and Malcev-Neumann series that applies to most constant term evaluation problems. These include (i) MacMahon's partition analysis, counting solutions of…
Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…
Let $\Pi_n$ denote the set of all set partitions of $\{1,2,\ldots,n\}$. We consider two subsets of $\Pi_n$, one connected to rook theory and one associated with symmetric functions in noncommuting variables. Let $\cE_n\sbe\Pi_n$ be the…
For a positive integer $r$, George Andrews proved that the set of partitions of $n$ in which odd multiplicities are at least $2r + 1$ is equinumerous with the set of partitions of $n$ in which odd parts are congruent to $2r + 1$ modulo $4r…
We introduce and study diamonds of GL(2,R)-invariant subvarieties of Abelian and quadratic differentials, which allow us to recover information on an invariant subvariety by simultaneously considering two degenerations, and which provide a…
We study rank $r$ cohomological Donaldson-Thomas theory on a toric Calabi-Yau orbifold of $\mathbb{C}^4$ by a finite abelian subgroup $\mathsf\Gamma$ of $\mathsf{SU}(4)$, from the perspective of instanton counting in cohomological gauge…
We introduce diffusions on a space of interval partitions of the unit interval that are stationary with the Poisson-Dirichlet laws with parameters $(\alpha,0)$ and $(\alpha,\alpha)$. The construction has two steps. The first is a general…
We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…
In the paper [J. Combin. Theory Ser. A 43 (1986), 103--113], Stanley gives formulas for the number of plane partitions in each of ten symmetry classes. This paper together with results by Andrews [J. Combin. Theory Ser. A 66 (1994), 28-39]…
We introduce a general model of dimer coverings of certain plane bipartite graphs, which we call rail yard graphs (RYG). The transfer matrices used to compute the partition function are shown to be isomorphic to certain operators arising in…
A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of the dual partitions are investigated and a convenient test is given for the case that the bidual partition…
A new algorithm for inserting rim-hooks into reverse plane partitions is presented. The insertion is used to define a bijection between reverse plane partitions of a fixed shape and multi-sets of rim-hooks. In turn this yields a bijective…
The partition functions of Pasquier models on the cylinder, and the associated intertwiners, are considered. It is shown that earlier results due to Saleur and Bauer can be rephrased in a geometrical way, reminiscent of formulae found in…