On the Real-Rootedness of the Descent Polynomials of $(n-2)$-Stack Sortable Permutations

  • Philip B. Zhang
DOI: https://doi.org/10.37236/4613
Keywords: Eulerian polynomials, descent polynomials, $t$-stack sortable permutations, real-rootedness, interlacing, compatibility.

Abstract

Bóna conjectured that the descent polynomials on $(n-2)$-stack sortable permutations have only real zeros. Brändén proved this conjecture by establishing a more general result. In this paper, we give another proof of Brändén's result by using the theory of $s$-Eulerian polynomials recently developed by Savage and Visontai.

Published
2015-10-16
How to Cite
Zhang, P. B. (2015). On the Real-Rootedness of the Descent Polynomials of $(n-2)$-Stack Sortable Permutations. The Electronic Journal of Combinatorics, 22(4), P4.12. https://doi.org/10.37236/4613
Issue
Volume 22, Issue 4 (2015)
Article Number
P4.12