The 𝐬-Eulerian polynomials have only real roots

Abstract

We study the roots of generalized Eulerian polynomials via a novel approach. We interpret Eulerian polynomials as the generating polynomials of a statistic over inversion sequences. Inversion sequences (also known as Lehmer codes or subexcedant functions) were recently generalized by Savage and Schuster, to arbitrary sequences s \mathbf {s} of positive integers, which they called s \mathbf {s} -inversion sequences. Our object of study is the generating polynomial of the ascent statistic over the set of s \mathbf {s} -inversion sequences of length n n . Since this ascent statistic over inversion sequences is equidistributed with the descent statistic over permutations, we call this generalized polynomial the s \mathbf {s} -Eulerian polynomial. The main result of this paper is that, for any sequence s \mathbf {s} of positive integers, the s \mathbf {s} -Eulerian polynomial has only real roots. This result is first shown to generalize several existing results about the real-rootedness of various Eulerian polynomials. We then show that it can be used to settle a conjecture of Brenti, that Eulerian polynomials for all finite Coxeter groups have only real roots, and partially settle a conjecture of Dilks, Petersen, Stembridge on type B affine Eulerian polynomials. It is then extended to several q q -analogs. We show that the MacMahon–Carlitz q q -Eulerian polynomial has only real roots whenever q q is a positive real number, confirming a conjecture of Chow and Gessel. The same holds true for the hyperoctahedral group and the wreath product groups, confirming further conjectures of Chow and Gessel, and Chow and Mansour, respectively. Our results have interesting geometric consequences as well.