Related papers: The combinatorics of MacMahon's partial fractions

The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…

We give a combinatorial proof of a result in rank 2 Donaldson-Thomas theory, which states that the generating function for certain plane-partition-like objects, called double-box configurations, is equal to a product of MacMahon's…

We develop the theory of copartitions, which are a generalization of partitions with connections to many classical topics in partition theory, including Rogers-Ramanujan partitions, theta functions, mock theta functions, partitions with…

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…

We introduce elliptic weights of boxed plane partitions and prove that they give rise to a generalization of MacMahon's product formula for the number of plane partitions in a box. We then focus on the most general positive degenerations of…

Extending the partition function multiplicatively to a function on partitions, we show that it has a unique maximum at an explicitly given partition for any $n\neq 7$. The basis for this is an inequality for the partition function which…

I propose two simple ways of generating the partitions of (n+1) from the partitions of n. A recurrence relation for P(n+1), the number of partitions of (n+1), in terms of P(n) and Q(n), where Q(n) denotes the number of partitions of n…

A vector partition function is the number of ways to write a vector as a non-negative integer-coefficient sum of the elements of a finite set of vectors $\Delta$. We present a new algorithm for computing closed-form formulas for vector…

Let $\alpha_k(\lambda)$ denote the number of $k$-hooks in a partition $\lambda$ and let $b(n,k)$ be the maximum value of $\alpha_k(\lambda)$ among partitions of $n$. Amdeberhan posed a conjecture on the generating function of $b(n,1)$. We…

We solve an elementary number theory problem on sums of fractional parts, using methods from group theory. We apply our result to deduce the finiteness of certain monodromy representations.

Previous work showed that, for $\nu_2(n)$ the number of partitions of $n$ into exactly two part sizes, one has $\nu_2(16n + 14) \equiv 0 \pmod{4}$. The earlier proof required the technology of modular forms, and a combinatorial proof was…

In a recent paper, Andrews and Merca investigated the number of even parts in all partitions of $n$ into distinct parts, which arise naturally from the Euler-Glaisher bijective proof. They obtained new combinatorial interpretations for this…

In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…

We study statistics on ordered set partitions whose generating functions are related to $p,q$-Stirling numbers of the second kind. The main purpose of this paper is to provide bijective proofs of all the conjectures of \stein…

We define a generalized vector partition function and derive an identity for generating series of such functions associated with solutions of basic recurrence relation of combinatorial analysis. As a consequence, we obtain the generating…

Using a new presentation for partition algebras (J. Algebraic Combin. 37(3):401-454, 2013), we derive explicit combinatorial formulae for the seminormal representations of the partition algebras. These results generalise to the partition…

In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first $r$ elements are in distinct blocks, respectively. We introduce a generalization of the Lah numbers. For…

In his book \emph{Topics in Analytic Number Theory}, Hans Rademacher conjectured that the limits of certain sequences of coefficients that arise in the ordinary partial fraction decomposition of the generating function for partitions of…

We describe a unified approach to calculating the partition functions of a general multi-level system with a free Hamiltonian. Particularly, we present new results for parastatistical systems of any order in the second quantized approach.…

In this article, we consider the weighted partition function $p_f(n)$ given by the generating series $\sum_{n=1}^{\infty} p_f(n)z^n = \prod_{n\in\mathbb{N}^{*}}(1-z^n)^{-f(n)}$, where we restrict the class of weight functions to strongly…