The sorting index
classification
🧮 math.CO
keywords
indexsortingcombinatoriallengthtypeanaloguesbivariatecall
read the original abstract
We consider a bivariate polynomial that generalizes both the length and reflection length generating functions in a finite Coxeter group. In seeking a combinatorial description of the coefficients, we are led to the study of a new Mahonian statistic, which we call the sorting index. The sorting index of a permutation and its type B and type D analogues have natural combinatorial descriptions which we describe in detail.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.