Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Two Conjectures Related to the Boros-Moll Sequences

Published 9 Sep 2026 in math.CO | (2609.10234v1)

Abstract: The Boros-Moll sequences di(m)<em>0im{d_i(m)}<em>{0\leq i\leq m} are defined as di(m)=2<sup>2m</sup></em>k=i<sup>m</sup>2<sup>k</sup>(2m2kmk)(m+kk)(ki).d_i(m)=2<sup>{-2m}\sum</sup></em>{k=i}<sup>m</sup> 2<sup>k</sup> \binom{2m-2k}{m-k}\binom{m+k}{k}\binom{k}{i}. Consider the ratio sequence ui(m)=di1(m)di+1(m)di(m)<sup>2.u_i(m)=\frac{d_{i-1}(m)d_{i+1}(m)}{d_i(m)<sup>2}. Chen and Gu conjectured that ui(m)<em>2im2{u_i(m)}<em>{2\leq i \leq m-2} is both reverse ultra log-concave and log-concave. In this paper, we prove the reverse ultra log-concavity conjecture using bounds of Chen-Gu and Zhao, and prove the log-concavity conjecture asymptotically by showing that ui(m)</em>2im2{u_i(m)}</em>{2\leq i \leq m-2} is strictly log-concave for all sufficiently large mm. The key ingredient in the latter result is a recurrence of Kauers and Paule, which we interpret as a nonlinear discrete dynamical system through a backward map. We construct an approximation to the ratio sequence using its stable limiting fixed point and combine localization and contraction arguments with finite-difference estimates and separate interior and edge analyses to obtain the desired strict log-concavity.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.