On the limiting distribution of some numbers of crossings in set partitions

arXiv1301.6540MaRDI QIDQ6239134FDOQ6239134

Authors: Anisse Kasraoui 

Publication date: 28 January 2013

Abstract: We study the asymptotic distribution of the two following combinatorial parameters: the number of arc crossings in the linear representation, $$, and the number of chord crossings in the circular representation, $$, of a random set partition. We prove that, for $kleqn/(2,logn)$ (resp., $k=o(sqrtn)$), the distribution of the parameter $$ (resp., $$) taken over partitions of $[n]:=1,2,\mathrm{...},n$ into $k$ blocks is, after standardization, asymptotically Gaussian as $n$ tends to infinity. We give exact and asymptotic formulas for the variance of the distribution of the parameter $$ from which we deduce that the distribution of $$ and $$ taken over all partitions of $[n]$ is concentrated around its mean. The proof of these results relies on a standard analysis of generating functions associated with the parameter $$ obtained in earlier work of Stanton, Zeng and the author. We also determine the maximum values of the parameters $$ and $$.

This page was built for publication: On the limiting distribution of some numbers of crossings in set partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6239134)