New combinatorial identity for the set of partitions and limit theorems in finite free probability theory
Abstract
We provide a refined combinatorial identity for the set of partitions of \1,…, n\, which plays an important role in investigating several limit theorems related to finite free convolutions. Firstly, we present the finite free analogue of Sakuma and Yoshida's limit theorem. That is, we provide the limit of \D1/m((pdd m)d m)\m∈ N as m→∞ in two cases: (i) m/d→ t for some t>0, or (ii) m/d→0. The second application presents a central limit theorem for finite free multiplicative convolution. We establish a connection between this theorem and the multiplicative free semicircular distributions through combinatorial identities. Our last result gives alternative proofs for Kabluchko's limit theorems concerning the unitary Hermite and the Laguerre polynomials.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.