Related papers: Labeled Partitions and the q-Derangement Numbers
We present a short proof of MacMahon's classic result that the number of permutations with $k$ inversions equals the number whose major index (sum of positions at which descents occur) is $k$
MacMahon introduced partition analysis in his book ``Combinatory Analysis'' as a computational technique for solving problems related to systems of linear Diophantine equations and inequalities. This paper aims to develop a fundamental…
Combining Carver's variant of the Farkas' lemma with the Flow Decomposition Theorem we show that the regions of any deformation of a graphical arrangement may be bijectively labeled with a set of weighted digraphs containing directed cycles…
In 1920, MacMahon introduced two families of $q$-series to study divisor sums. Recent work has shown that MacMahon's $q$-series are closely connected to overpartitions and $3$-colored partitions. Merca introduced truncated forms 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…
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…
In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply…
We use the $q$-binomial theorem, the $q$-Gauss sum, and the ${}_2\phi_1 \rightarrow {}_2\phi_2$ transformation of Jackson to discover and prove many new weighted partition identities. These identities involve unrestricted partitions,…
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…
Schmidt's theorem is significantly generalized, to partitions in which periodic but otherwise arbitrary subsets of parts are counted or uncounted. The identification of such sets of partitions with colored partitions satisfying certain…
We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…
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…
In a recent paper, Goyt and Sagan studied distributions of certain set partition statistics over pattern restricted sets of set partitions that were counted by the Fibonacci numbers. Their study produced a class of $q$-Fibonacci numbers,…
We use an injection method to prove a new class of partition inequalities involving certain $q$-products with two to four finitization parameters. Our new theorems are a substantial generalization of work by Andrews and of previous work by…
We introduce several statistics on ordered partitions of sets, that is, set partitions where the blocks are permuted arbitrarily. The distribution of these statistics is closely related to the q-Stirling numbers of the second kind. Some of…
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…
In a series of papers, George Andrews and various coauthors successfully revitalized seemingly forgotten, powerful machinery based on MacMahon's $\Omega$ operator to systematically compute generating functions $\sum_{\la \in P}…
This article is part of an ongoing investigation of the combinatorics of $q,t$-Catalan numbers $\textrm{Cat}_n(q,t)$. We develop a structure theory for integer partitions based on the partition statistics dinv, deficit, and minimum triangle…
The number of plane partitions contained in a given box was shown by MacMahon to be given by a simple product formula. By a simple bijection, this formula also enumerates lozenge tilings of hexagons of side-lengths $a,b,c,a,b,c$ (in cyclic…
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…