Narayana transformation preserves log-convexity

Let N(n,k)N(n,k) be the Narayana numbers, and let (xk)k0(x_k)_{k\geq 0} be a sequence for which log-convexity is defined. Define its Narayana transformation by

zn=k=0nN(n,k)xk.z_n=\sum_{k=0}^{n}N(n,k)x_k.

Narayana transformation conjecture. The Narayana transformation preserves log-convexity. The source presents this as a problem following known log-convexity results for specializations of the Narayana polynomials; the required hypotheses on the input sequence are not made explicit in the supplied passage.

Sources & referencesView supporting material

Primary 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.