English

The Briggs inequality of Boros-Moll sequences

Combinatorics 2024-02-20 v1

Abstract

Briggs conjectured that if a polynomial a0+a1x++anxna_0+a_1x+\cdots+a_nx^n with real coefficients has only negative zeros, then ak2(ak2ak1ak+1)>ak12(ak+12akak+2)a^2_k(a^2_k - a_{k-1}a_{k+1}) > a^2_{k-1}(a^2_{k+1} - a_ka_{k+2}) for any 1kn11\leq k\leq n-1. The Boros-Moll sequence {di(m)}i=0m\{d_i(m)\}_{i=0}^m arises in the study of evaluation of certain quartic integral, and a lot of interesting inequalities for this sequence have been obtained. In this paper we show that the Boros-Moll sequence {di(m)}i=0m\{d_i(m)\}_{i=0}^m, its normalization {di(m)/i!}i=0m\{d_i(m)/i!\}_{i=0}^m, and its transpose {di(m)}mi\{d_i(m)\}_{m\ge i} satisfy the Briggs inequality. For the first two sequences, we prove the Briggs inequality by using a lower bound for (di1(m)di+1(m))/di2(m)(d_{i-1}(m)d_{i+1}(m))/d_i^2(m) due to Chen and Gu and an upper bound due to Zhao. For the transposed sequence, we derive the Briggs inequality by establishing its strict ratio-log-convexity. As a consequence, we also obtain the strict log-convexity of the sequence {di(i+n)n}n1\{\sqrt[n]{d_i(i+n)}\}_{n\ge 1} for i1i\ge 1.

Keywords

Cite

@article{arxiv.2402.11620,
  title  = {The Briggs inequality of Boros-Moll sequences},
  author = {Zhong-Xue Zhang and James Jing Yu Zhao},
  journal= {arXiv preprint arXiv:2402.11620},
  year   = {2024}
}

Comments

18 pages