Moments of partition statistics, Bell polynomials and Eisenstein-type series
Abstract
We develop a systematic method to express generating functions for moments of combinatorial statistics in terms of partition traces. We employ an algebraic approach based on the complete Bell polynomials and their inversion formula, alongside an analytic approach via Faà di Bruno's formula. Our approach can be applied to a wide class of combinatorial statistics, such as the largest part of an integer partition, the partition crank and rank, and the unimodal sequence rank.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.