Zhao’s infinite-log-concavity conjecture and related log-concavity conjectures
For every fixed integer , let be the transposed Boros--Moll coefficient sequence defined by . Define the log-concavity operator by , with . The conjecture asserts that is infinitely log-concave: for every , .
References
- A unified approach to infinite log-concavity of combinatorial sequences — arXiv — Matthew H. Y. Xie, Candice X. T. Zhang, Philip B. Zhang
Source: arXiv
Progress summary
A 2026 preprint claims to settle the Boros–Moll part of the problem, but the broader collection of conjectures remains unverified and unresolved.
The problem groups Zhao’s infinite-log-concavity conjecture with related conjectures for several combinatorial families. Retrieved sources support substantial partial results, plus a recent unrefereed claim covering the ordinary Boros–Moll conjecture.
Known results
- McNamara and Steingrímsson (2008) proved infinite log-concavity for Pascal rows only through by computer-assisted methods.
- A 2024 study proved strict extended reverse ultra-log-concavity and bounds for transposed Boros–Moll sequences, while leaving the original infinite-log-concavity conjecture open.
- Related work established reverse ultra-log-concavity and asymptotic log-concavity results for Boros–Moll sequences.
2026 Boros–Moll resolution claim
A preprint by Matthew H. Y. Xie, Candice X. T. Zhang, and Philip B. Zhang claims that, for every , a polynomial formed from the Boros–Moll coefficients has simple negative zeros with strict interlacing, implying the Boros–Moll infinite-log-concavity conjecture. The claim is unverified and does not, in the retrieved evidence, cover the normalized Euler difference tables or iterated primitives of in the broader problem.
Current status (as of October 2026): The Boros–Moll component has a claimed but unverified resolution; the broader Zhao-related collection, including the other named families, remains open.
Solutions 0
No solutions have been posted yet.