The Briggs inequality of Boros-Moll sequences
Abstract
Briggs conjectured that if a polynomial a0+a1x+·s+anxn with real coefficients has only negative zeros, then a2k(a2k - ak-1ak+1) > a2k-1(a2k+1 - akak+2) for any 1≤ k≤ n-1. The Boros-Moll sequence \di(m)\i=0m 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, its normalization \di(m)/i!\i=0m, and its transpose \di(m)\m i satisfy the Briggs inequality. For the first two sequences, we prove the Briggs inequality by using a lower bound for (di-1(m)di+1(m))/di2(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 \[n]di(i+n)\n 1 for i 1.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.