English

Boolean, Free, and Classical Cumulants as Tree Enumerations

Combinatorics 2024-09-10 v1

Abstract

Defant found that the relationship between a sequence of (univariate) classical cumulants and the corresponding sequence of (univariate) free cumulants can be described combinatorially in terms of families of binary plane trees called troupes. Using a generalization of troupes that we call weighted troupes, we generalize this result to allow for multivariate cumulants. Our result also gives a combinatorial description of the corresponding Boolean cumulants. This allows us to answer a question of Defant regarding his troupe transform. We also provide explicit distributions whose cumulants correspond to some specific weighted troupes.

Keywords

Cite

@article{arxiv.2409.05219,
  title  = {Boolean, Free, and Classical Cumulants as Tree Enumerations},
  author = {Colin Defant and Mitchell Lee},
  journal= {arXiv preprint arXiv:2409.05219},
  year   = {2024}
}

Comments

18 pages, 7 figures

R2 v1 2026-06-28T18:37:55.218Z