Related papers: Mahonian Partition Identities Via Polyhedral Geome…
In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations…
We prove polynomial boson-fermion identities for the generating function of the number of partitions of $n$ of the form $n=\sum_{j=1}^{L-1} j f_j$, with $f_1\leq i-1$, $f_{L-1} \leq i'-1$ and $f_j+f_{j+1}\leq k$. The bosonic side of the…
We generalize the generating formula for plane partitions known as MacMahon's formula as well as its analog for strict plane partitions. We give a 2-parameter generalization of these formulas related to Macdonald's symmetric functions. The…
We provide a refinement of MacMahon's partition identity on sequence-avoiding partitions, and use it to produce another mod 6 partition identity. In addition, we show that our technique also extends to cover Andrews's generalization of…
In this paper, we consider various theorems of P.A. MacMahon and M.V. Subbarao. For a non-negative integer $n$, MacMahon proved that the number of partitions of $n$ wherein parts have multiplicity greater than 1 is equal to the number of…
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…
A classical theorem of MacMahon states that the number of lozenge tilings of any centrally symmetric hexagon drawn on the triangular lattice is given by a beautifully simple product formula. In this paper we present a counterpart of this…
By a re-examination of MacMahon's original proof of his celebrated theorem on the distribution of the major indices over permutations, we give a reformulation of his argument in terms of the structure of labeled partitions. In this…
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…
Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…
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…
In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn…
We show that integer partitions, the fundamental building blocks in additive number theory, detect prime numbers in an unexpected way. Answering a question of Schneider, we show that the primes are the solutions to special equations in…
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…
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.
The study of partitions with parts separated by parity was initiated by Andrews in connection with Ramanujan's mock theta functions, and his variations on this theme have produced generating functions with a large variety of different…
Partitions with initial repetitions were introduced by George Andrews. We consider a subclass of these partitions and find Legendre theorems associated with their respective partition functions. The results in turn provide partition…
A classical result of MacMahon states that inversion number and major index have the same distribution over permutations of a given multiset. In this work we prove a strengthening of this theorem originally conjectured by Haglund. Our…
Recently, George Andrews has given a Glaisher style proof of a finite version of Euler's partition identity. We generalise this result by giving a finite version of Glaisher's partition identity. Both the generating function and bijective…
Starting from an integrable rank-$n$ vertex model, we construct an explicit family of partition functions indexed by compositions $\mu = (\mu_1,\dots,\mu_n)$. Using the Yang-Baxter algebra of the model and a certain rotation operation that…