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

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…