We study the polynomials obtained by enumerating a finite Coxeter group by number of descents. The type A case gives rise to the familiar Eulerian polynomials, while the B and D cases provided two new q -analogues. Various recursion relations, generating functions and unimodality properties are derived, which generalize and unify earlier results of Dolgachev, Lunts, Stanley and Stembridge. © 1994 Academic Press, Inc.
CITATION STYLE
Brenti, F. (1994). q-Eulerian polynomials arising from coxeter groups. European Journal of Combinatorics, 15(5), 417–441. https://doi.org/10.1006/eujc.1994.1046
Mendeley helps you to discover research relevant for your work.