






















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.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。