A simple proof of higher order Tur\'{a}n inequalities for Boros-Moll sequences
James Jing Yu Zhao

TL;DR
This paper presents a simplified proof of higher order Turán inequalities for Boros-Moll sequences using a criterion based on checking four inequalities, leveraging bounds from previous studies, and establishing new bounds that imply log-concavity.
Contribution
It introduces a novel, simpler proof method for higher order Turán inequalities for Boros-Moll sequences based on a criterion requiring only four inequalities, utilizing existing bounds and deriving new ones.
Findings
Established a new proof approach for Turán inequalities
Derived a lower bound implying log-concavity of the sequences
Proposed a sharper lower bound for future inequality studies
Abstract
Recently, the higher order Tur\'{a}n inequalities for the Boros-Moll sequences were obtained by Guo. In this paper, we show a different approach to this result. Our proof is based on a criterion derived by Hou and Li, which need only checking four simple inequalities related to sufficiently sharp bounds for . In order to do so, we adopt the upper bound given by Chen and Gu in studying the reverse ultra log-concavity of Boros-Moll polynomials, and establish a desired lower bound for which also implies the log-concavity of for . We also show a sharper lower bound for which may be available for some deep results on inequalities of Boros-Moll sequences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Analytic and geometric function theory
