On the real-rootedness of the descent polynomials of \((n-2)\)-stack sortable permutations (Q888620)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6502798
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the real-rootedness of the descent polynomials of \((n-2)\)-stack sortable permutations |
scientific article; zbMATH DE number 6502798 |
Statements
On the real-rootedness of the descent polynomials of \((n-2)\)-stack sortable permutations (English)
0 references
2 November 2015
0 references
Summary: \textit{M. Bóna} [J. Comb. Theory, Ser. A 98, No. 1, 201--209 (2002; Zbl 1009.05003)] conjectured that the descent polynomials on \((n-2)\)-stack sortable permutations have only real zeros. \textit{P. Brändén} [Trans. Am. Math. Soc. 358, No. 8, 3697--3716 (2006; Zbl 1086.05007)] 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 \textit{C. D. Savage} and \textit{M. Visontai} [Trans. Am. Math. Soc. 367, No. 2, 1441--1466 (2015; Zbl 1316.05002)].
0 references
Eulerian polynomials
0 references
descent polynomials
0 references
\(t\)-stack sortable permutations
0 references
real-rootedness
0 references
interlacing
0 references
compatibility
0 references
0.7912381291389465
0 references
0.781926155090332
0 references
0.7748458981513977
0 references
0.7629780769348145
0 references
0.7567439675331116
0 references
