Liu–Wang's log-convexity conjecture for the Eulerian transformation

About 18 years old · traced to

Let {xn}n≥0\{x_n\}_{n\geq 0} be a sequence of nonnegative numbers, and define zn=∑k=0nAn,kxkz_n=\sum_{k=0}^n A_{n,k}x_k using the Eulerian triangle {An,k}0≤k≤n\{A_{n,k}\}_{0\leq k\leq n}. A sequence {an}n≥0\{a_n\}_{n\geq 0} is log-convex if ak2≤ak−1ak+1a_k^2\leq a_{k-1}a_{k+1} for every k≥1k\geq 1. Liu–Wang's conjecture. The Eulerian transformation preserves log-convexity: whenever {xn}\{x_n\} is log-convex, so is {zn}\{z_n\}. Liu and Wang proposed this conjecture after establishing analogous results for the binomial and Stirling transformations. It is stated in the source as still open.

References

Primary source

Lily Li Liu and Bao-Xuan Zhu, “Strong q-log-convexity of the Eulerian polynomials of Coxeter groups”, arXiv:1407.1968 (2014).

Additional references

2 papers in this index state this conjecture (2008–2014). The statement above is taken from the most recent of them; the others are arXiv:0806.1561.

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.