Using Rota's Umbral calculus to enumerate Stanley's \(P\)-partitions

DOI10.1016/j.aam.2007.09.001zbMath1161.05005OpenAlexW2066466600MaRDI QIDQ931837

Doron Zeilberger, Shalosh B. XIV Ekhad

Publication date: 26 June 2008

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2007.09.001

zbMATH Keywords

generating functionStanley's P-partitionsweight of a compositionweight of a partition

Mathematics Subject Classification ID

Umbral calculus (05A40) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17)

Related Items

On \(P\)-partitions related to ordinal sums of posets

Uses Software

• ZOO
• RotaStanley
• USAP
• USAW
• MAYLIS
• ROTA
• Omega
• PPar

Cites Work

• Unnamed Item
• Unnamed Item
• The umbral calculus
• The umbral transfer-matrix method. I: Foundations
• A fast algorithm for MacMahon's partition analysis
• A Note on Solid Partitions
• Ordered structures and partitions
• The umbral transfer-matrix method. IV: Counting self-avoiding polygons and walks
• MacMahon's partition analysis: The Omega package
• The umbral transfer-matrix method. III: Counting animals
• MacMahon's partition analysis. VIII: Plane partition diamonds