← All problems

Narayana polynomials form a q-log-convex sequence

20 years old · traced to

The Narayana number N(n,k)N(n,k) counts Dyck paths of length 2n2n with exactly kk peaks, and the Narayana polynomials are Nn(q)=∑k=0nN(n,k)qkN_n(q)=\sum_{k=0}^{n}N(n,k)q^k. A sequence of polynomials is q-log-convex when each difference Nn+1(q)Nn−1(q)−Nn(q)2N_{n+1}(q)N_{n-1}(q)-N_n(q)^2 has nonnegative coefficients. Narayana polynomials conjecture. The Narayana polynomials Nn(q)N_n(q) form a qq-log-convex sequence.

References

Status

  • Solved: William Y. C. Chen, Larry X. W. Wang, and Arthur L. B. Yang. Schur Positivity and the q-Log-convexity of the Narayana Polynomials (Journal of Algebraic Combinatorics, 2010) https://doi.org/10.1007/s10801-010-0216-x

Source: Li Liu and Yi Wang, “On the log-convexity of combinatorial sequences”, arXiv:math/0602672 (2006).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.