English

Mutual Interlacing and Eulerian-like Polynomials for Weyl Groups

Combinatorics 2014-01-27 v1 Classical Analysis and ODEs

Abstract

We use the method of mutual interlacing to prove two conjectures on the real-rootedness of Eulerian-like polynomials: Brenti's conjecture on qq-Eulerian polynomials for Weyl groups of type DD, and Dilks, Petersen, and Stembridge's conjecture on affine Eulerian polynomials for irreducible finite Weyl groups. For the former, we obtain a refinement of Brenti's qq-Eulerian polynomials of type DD, and then show that these refined Eulerian polynomials satisfy certain recurrence relation. By using the Routh--Hurwitz theory and the recurrence relation, we prove that these polynomials form a mutually interlacing sequence for any positive qq, and hence prove Brenti's conjecture. For q=1q=1, our result reduces to the real-rootedness of the Eulerian polynomials of type DD, which were originally conjectured by Brenti and recently proved by Savage and Visontai. For the latter, we introduce a family of polynomials based on Savage and Visontai's refinement of Eulerian polynomials of type DD. We show that these new polynomials satisfy the same recurrence relation as Savage and Visontai's refined Eulerian polynomials. As a result, we get the real-rootedness of the affine Eulerian polynomials of type DD. Combining the previous results for other types, we completely prove Dilks, Petersen, and Stembridge's conjecture, which states that, for every irreducible finite Weyl group, the affine descent polynomial has only real zeros.

Keywords

Cite

@article{arxiv.1401.6273,
  title  = {Mutual Interlacing and Eulerian-like Polynomials for Weyl Groups},
  author = {Arthur L. B. Yang and Philip B. Zhang},
  journal= {arXiv preprint arXiv:1401.6273},
  year   = {2014}
}

Comments

28 pages

R2 v1 2026-06-22T02:53:57.387Z