Boros–Moll infinite q-log-convexity conjecture

From papers

Let Pn(x)P_n(x) be the Boros–Moll polynomials, whose coefficients form a polynomial sequence in nn. A polynomial sequence is infinitely qq-log-convex if every iterate under the operator

L{fi(q)}i0={fi1(q)fi+1(q)fi(q)2}i1\mathcal{L}\{f_i(q)\}_{i\geq 0}=\{f_{i-1}(q)f_{i+1}(q)-f_i(q)^2\}_{i\geq 1}

has coefficientwise nonnegative polynomials. Boros–Moll's conjecture. The Boros–Moll polynomials are infinitely qq-log-convex. This extends known finite-order qq-log-convexity results; the stronger infinite property is stated as an open conjecture.

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

Bao-Xuan Zhu, “Positivity of iterated sequences of polynomials”, arXiv:1807.01062 (2018).

Additional references

3 papers in this index state this conjecture (2009–2018). The statement above is taken from the most recent of them; the others are arXiv:1602.00521, arXiv:0909.1927.

Solutions 0

No solutions have been posted yet.