Asymptotics of a Locally Dependent Statistic on Finite Reflection Groups
This paper discusses the asymptotic behaviour of the number of descents in a random signed permutation and its inverse, which was listed as an interesting direction by Chatterjee and Diaconis (2017). For that purpose, we generalize their result for the asymptotic normality of the number of descents...
Gespeichert in:
Veröffentlicht in: | The Electronic journal of combinatorics 2020-05, Vol.27 (2) |
---|---|
1. Verfasser: | |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper discusses the asymptotic behaviour of the number of descents in a random signed permutation and its inverse, which was listed as an interesting direction by Chatterjee and Diaconis (2017). For that purpose, we generalize their result for the asymptotic normality of the number of descents in a random permutation and its inverse to other finite reflection groups. This is achieved by applying their proof scheme to signed permutations, i.e. elements of Coxeter groups of type $ \mathtt{B}_n $, which are also known as the hyperoctahedral groups. Furthermore, a similar central limit theorem for elements of Coxeter groups of type $\mathtt{D}_n$ is derived via Slutsky's Theorem and a bound on the Wasserstein distance of certain normalized statistics with local dependency structures and bounded local components is proven for both types of Coxeter groups. In addition, we show a two-dimensional central limit theorem via the Cramér-Wold device. |
---|---|
ISSN: | 1077-8926 1077-8926 |
DOI: | 10.37236/9454 |