Boros–Moll infinite q-log-convexity conjecture
Boros–Moll infinite q-log-convexity conjecture
Let be the Boros–Moll polynomials, whose coefficients form a polynomial sequence in . A polynomial sequence is infinitely -log-convex if every iterate under the operator
has coefficientwise nonnegative polynomials. Boros–Moll's conjecture. The Boros–Moll polynomials are infinitely -log-convex. This extends known finite-order -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
Sign in to submit a solution.
No solutions have been posted yet.