Boros–Moll infinite log-concavity conjecture

For each integer n≥1n\ge 1, define the Boros--Moll coefficients by Pn(x)=2−2n∑k=0n2k(2n+12k+1)(x+1)k=∑i=0ndi(n)xiP_n(x)=2^{-2n}\sum_{k=0}^{n}2^k\binom{2n+1}{2k+1}(x+1)^k=\sum_{i=0}^{n}d_i(n)x^i. Extend the finite sequence by setting di(n)=0d_i(n)=0 for i∉{0,…,n}i\notin\{0,\ldots,n\}. Define the log-concavity operator L\mathcal{L} by L(a)i=ai2−ai−1ai+1\mathcal{L}(a)_i=a_i^2-a_{i-1}a_{i+1}. The Boros--Moll conjecture asserts that, for every n≥1n\ge 1, every integer r≥0r\ge 0, and every integer ii, Lr((dj(n))j∈Z)i≥0\mathcal{L}^{r}((d_j(n))_{j\in\mathbb{Z}})_i\ge 0; equivalently, the Boros--Moll coefficient sequence is infinitely log-concave.

References

Primary source

arXiv

Additional references

Progress summary

Refreshed
Claimed solved

A new unrefereed preprint claims to settle the conjecture, but the proof has not yet been independently verified.

Boros and Moll conjectured that the coefficient sequence of their special-function expansion is infinitely log-concave. Earlier work established only finite levels of log-concavity and related polynomial properties.

Known results

  • Chen, Dou, and Yang confirmed auxiliary real-rootedness conjectures, implying 22- and 33-log-concavity.
  • The 2013 literature established 22-log-concavity, while the full $$-log-concavity conjecture remained open.

September 17, 2026 claimed solution

Matthew H. Y. Xie and Philip B. Zhang’s new preprint is reported to prove a stronger real-rootedness and interlacing theorem, then apply Brändén’s preservation theorem to obtain infinite log-concavity. This is a claimed complete resolution, but the preprint is unrefereed and independent verification is absent.

Current status (as of September 2026): Infinite log-concavity is claimed solved by Xie and Zhang, but the new proof remains unverified; the previously established results cover only finite levels.

Sources

Solutions 0

No solutions have been posted yet.