相关论文: A historical survey of P-partitions

These notes provide a survey of the theory of plane partitions, seen through the glasses of the work of Richard Stanley and his school.

Recently, Andrews and Paule studied Schmidt type partitions using MacMahon's Partition Analysis and obtained various interesting results. In this paper, we focus on the combinatorics of Schmidt type partition theorems and characterize them…

This expository paper features a few highlights of Richard Stanley's extensive work in Ehrhart theory, the study of integer-point enumeration in rational polyhedra. We include results from the recent literature building on Stanley's work,…

Stanley's theory of $(P,\omega)$-partitions is a standard tool in combinatorics. It can be extended to allow for the presence of a restriction, that is a given maximal value for partitions at each vertex of the poset, as was shown by Assaf…

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.

Recently, many authors have investigated how various partition statistics distribute as the size of the partition grows. In this work, we look at a particular statistic arising from the recent rejuvenation of MacMahon's partition analysis.…

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…

In this paper we go on to discuss about Stanley's theorem in Integer partitions. We give two different versions for the proof of the generalization of Stanley's theorem illustrating different techniques that may be applied to profitably…

Plane partition diamonds were introduced by Andrews, Paule, and Riese (2001) as part of their study of MacMahon's $\Omega$-operator in search for integer partition identities. More recently, Dockery, Jameson, Sellers, and Wilson (2024)…

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…

In this paper, we use the Lambert series generating function for Euler's totient function to introduce a new identity for the number of $1$'s in the partitions of $n$. A new expansion for Euler's partition function $p(n)$ is derived in this…

Richard Stanley played a crucial role, through his work and his students, in the development of the relatively new area known as combinatorial representation theory. In the early stages, he has the merit to have pointed out to…

We study cylindric partitions with two-element profiles using MacMahon's partition analysis. We find explicit formulas for the generating functions of the number of cylindric partitions by first finding the recurrences using partition…

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…

Mass partition problems describe the partitions we can induce on a family of measures or finite sets of points in Euclidean spaces by dividing the ambient space into pieces. In this survey we describe recent progress in the area in addition…

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…

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…

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…

I will share with the reader what I have learned from Richard Stanley and the ways in which he has contributed to research in combinatorics conducted by me and my collaborators.

The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…