Concepedia

Publication | Open Access

𝑞-Eulerian polynomials: Excedance number and major index

62

Citations

31

References

2007

Year

Abstract

In this research announcement we present a new <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="q"> <mml:semantics> <mml:mi>q</mml:mi> <mml:annotation encoding="application/x-tex">q</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-analog of a classical formula for the exponential generating function of the Eulerian polynomials. The Eulerian polynomials enumerate permutations according to their number of descents or their number of excedances. Our <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="q"> <mml:semantics> <mml:mi>q</mml:mi> <mml:annotation encoding="application/x-tex">q</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-Eulerian polynomials are the enumerators for the joint distribution of the excedance statistic and the major index. There is a vast literature on <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="q"> <mml:semantics> <mml:mi>q</mml:mi> <mml:annotation encoding="application/x-tex">q</mml:annotation> </mml:semantics> </mml:math> </inline-formula>-Eulerian polynomials that involves other combinations of Eulerian and Mahonian permutation statistics, but this is the first result to address the combination of excedance number and major index. We use symmetric function theory to prove our formula. In particular, we prove a symmetric function version of our formula, which involves an intriguing new class of symmetric functions. We also discuss connections with (1) the representation of the symmetric group on the homology of a poset introduced by Björner and Welker; (2) the representation of the symmetric group on the cohomology of the toric variety associated with the Coxeter complex of the symmetric group, studied by Procesi, Stanley, Stembridge, Dolgachev, and Lunts; (3) the enumeration of words with no adjacent repeats studied by Carlitz, Scoville, and Vaughan and by Dollhopf, Goulden, and Greene; and (4) Stanley’s chromatic symmetric functions.

References

YearCitations

Page 1