On the real-rootedness of the descent polynomials of \((n-2)\)-stack sortable permutations
The electronic journal of combinatorics, Tome 22 (2015) no. 4
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.
DOI :
10.37236/4613
Classification :
05A15, 26C10
Mots-clés : Eulerian polynomials, descent polynomials, \(t\)-stack sortable permutations, real-rootedness, interlacing, compatibility
Mots-clés : Eulerian polynomials, descent polynomials, \(t\)-stack sortable permutations, real-rootedness, interlacing, compatibility
Affiliations des auteurs :
Philip B. Zhang  1
@article{10_37236_4613,
author = {Philip B. Zhang},
title = {On the real-rootedness of the descent polynomials of \((n-2)\)-stack sortable permutations},
journal = {The electronic journal of combinatorics},
year = {2015},
volume = {22},
number = {4},
doi = {10.37236/4613},
zbl = {1323.05013},
url = {http://geodesic.mathdoc.fr/articles/10.37236/4613/}
}
Philip B. Zhang. On the real-rootedness of the descent polynomials of \((n-2)\)-stack sortable permutations. The electronic journal of combinatorics, Tome 22 (2015) no. 4. doi: 10.37236/4613
Cité par Sources :