Bóna's real-rootedness conjecture for descent polynomials of stack-sortable permutations

From papers

Let Wt(n,k)W_{t}(n,k) be the number of tt-stack sortable permutations in Sn\mathfrak{S}_n with kk descents, and define the descent polynomial

Wn,t(x)=k=0n1Wt(n,k)xk.W_{n,t}(x)=\sum_{k=0}^{n-1}W_{t}(n,k)x^{k}.

Bóna's real-rootedness conjecture. The descent polynomial Wn,t(x)W_{n,t}(x) has only real zeros for any integer 1tn11 \le t \le n-1.

Bóna had previously shown that, for fixed nn and tt, Wn,t(x)W_{n,t}(x) is symmetric and unimodal. The abstract states that Brändén proved this conjecture as a consequence of a more general result, and the paper gives another proof using s\mathbf{s}-Eulerian polynomials.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Philip B. Zhang, “On the Real-rootedness of the Descent Polynomials of (n-2)-Stack Sortable Permutations”, arXiv:1408.4235 (2016).

Solutions 0

No solutions have been posted yet.