Extreme Values of Permutation Statistics
Philip Dörr, Thomas Kahle
TL;DR
The article addresses extreme values of Mahonian and Eulerian statistics on finite Coxeter groups by constructing row-wise triangular arrays of independent samples across increasing ranks. By decomposing inversion and descent counts into independent summands via generating-function factorizations and applying advanced large-deviation and Berry–Esseen techniques, the authors establish Gumbel-type limit laws for the maxima under precise growth conditions on the row size $k_n$. They obtain detailed EVLT results for sequences of classical Weyl groups, arbitrary finite Coxeter groups, products of Weyl groups, and dihedral compounds, and prove a universal extreme-value theorem that applies under a Berry–Esseen framework with sublinear growth of $k_n$. These results illuminate when extremes of permutation statistics converge to the Gumbel distribution and offer a roadmap for extending extreme-value theory to structured combinatorial settings with dependent statistics.
Abstract
We investigate extreme values of Mahonian and Eulerian distributions arising from counting inversions and descents of random elements of finite Coxeter groups. To this end, we construct a triangular array of either distribution from a sequence of Coxeter groups with increasing ranks. To avoid degeneracy of extreme values, the number of i.i.d. samples $k_n$ in each row must be asymptotically bounded. We employ large deviations theory to prove the Gumbel attraction of Mahonian and Eulerian distributions. It is shown that for the two classes, different bounds on $k_n$ ensure this.
