Search arXiv⌕ Search

arXiv · 2609.10234

On Two Conjectures Related to the Boros-Moll Sequences

Abstract

The Boros-Moll sequences $\{d_i(m)\}_{0\leq i\leq m}$ are defined as $$d_i(m)=2^{-2m}\sum_{k=i}^m 2^k \binom{2m-2k}{m-k}\binom{m+k}{k}\binom{k}{i}.$$ Consider the ratio sequence $$u_i(m)=\frac{d_{i-1}(m)d_{i+1}(m)}{d_i(m)^2}.$$ Chen and Gu conjectured that $\{u_i(m)\}_{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 $\{u_i(m)\}_{2\leq i \leq m-2}$ is strictly log-concave for all sufficiently large $m$. 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Heshan Aravinda. 2026-09-11. On Two Conjectures Related to the Boros-Moll Sequences. https://arxiv.org/abs/2609.10234

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗