[Paper Review] A historical survey of P-partitions

Ira M. Gessel|arXiv (Cornell University)|Jun 10, 2015

Advanced Combinatorial Mathematics41 references16 citations

TL;DR

This paper provides a comprehensive historical survey of P-partitions, tracing their development from MacMahon’s work on plane partitions through Stanley’s foundational theory, which establishes a fundamental theorem linking P-partitions to linear extensions of labeled posets. The key contribution is the systematic exposition of how P-partitions generate symmetric functions and order polynomials, with extensions to enriched P-partitions and applications in algebraic combinatorics.

ABSTRACT

We give a historical survey of the theory P-partitions, starting with MacMahon's work, describing Richard Stanley's contributions and his related work, and continuing with more recent developments.

Motivation & Objective

• To trace the historical evolution of P-partitions from MacMahon’s early work on plane partitions to modern developments.
• To clarify Stanley’s foundational contributions, particularly the fundamental theorem linking P-partitions to linear extensions of labeled posets.
• To survey recent generalizations, including enriched P-partitions and their connections to symmetric and quasi-symmetric functions.
• To highlight applications in algebraic combinatorics, such as peak algebras, order polynomials, and symmetric group representations.
• To provide a unified overview of the theory for researchers seeking a comprehensive reference on P-partitions and their role in enumerative combinatorics.

Proposed method

• Uses Stanley’s formalism of (P,ω)-partitions: maps σ: P → ℕ satisfying order-reversing and labeling-dependent inequalities.
• Applies the fundamental theorem of P-partitions, which decomposes the set of all (P,ω)-partitions into disjoint unions indexed by linear extensions of P.
• Employs generating functions, including the quasi-symmetric generating function Δ(P,ω) and the order polynomial Ω(P,ω;m), to encode enumeration data.
• Utilizes the major index (maj) and descent statistic (des) on permutations to express generating functions in terms of symmetric function theory.
• Generalizes to enriched P-partitions via signed integer-valued maps, with conditions based on sign and labeling order.
• Applies Hopf algebraic structures and poset-theoretic tools (e.g., ab-index, flag h-vectors) to unify and extend the theory.

Experimental results

Research questions

• RQ1 How did the theory of P-partitions evolve from MacMahon’s work on plane partitions to Stanley’s formalization?
• RQ2 What is the role of linear extensions in the decomposition of P-partitions, and how does the fundamental theorem enable enumeration?
• RQ3 How do enriched P-partitions generalize ordinary P-partitions, and what algebraic structures do they generate?
• RQ4 In what ways do P-partitions connect to symmetric functions, peak algebras, and the symmetric group?
• RQ5 What are the implications of the generating functions for P-partitions in relation to q-analogues of combinatorial numbers like Narayana and Stirling numbers?

Key findings

• The fundamental theorem of P-partitions states that the set of all (P,ω)-partitions is the disjoint union of sets indexed by linear extensions of P, enabling enumeration via permutation statistics.
• The generating function U(P,ω) is expressed as a rational function involving the major index over linear extensions: U(P,ω) = ∑_{π∈ℒ(P,ω)} q^{maj(π)} / ∏_{i=1}^p (1 - q^i).
• The order polynomial Ω(P,ω;m) is the evaluation of the generating function at q=1, and its generating function is ∑_{m≥0} Ω(P,ω;m) t^m = ∑_{π∈ℒ(P,ω)} t^{1+des(π)} / (1-t)^{p+1}.
• Enriched P-partitions yield a basis for a subalgebra of quasi-symmetric functions, with generating function Δ(P,ω) depending only on the peak set of each linear extension.
• The generating function Δ(π,ω) for a permutation π depends only on its peak set, and this property underlies the construction of the peak algebra of the symmetric group.
• Applications include q-analogues of Stirling numbers and Narayana numbers, as well as connections to commutative algebra and Hopf algebras on finite topologies.