The Briggs inequality of Boros-Moll sequences
Combinatorics
2024-02-20 v1
Abstract
Briggs conjectured that if a polynomial with real coefficients has only negative zeros, then for any . The Boros-Moll sequence 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 , its normalization , and its transpose satisfy the Briggs inequality. For the first two sequences, we prove the Briggs inequality by using a lower bound for 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 for .
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