The extended reverse ultra log-concavity of transposed Boros-Moll sequences
James J. Y. Zhao

TL;DR
This paper proves the extended reverse ultra log-concavity of transposed Boros-Moll sequences, providing bounds and demonstrating they have stronger log-concavity properties than the original sequences, advancing understanding of their inequalities.
Contribution
It establishes the extended reverse ultra log-concavity of transposed Boros-Moll sequences and compares their log-concavity strength to the original sequences, introducing new bounds and conjectures.
Findings
Proved extended reverse ultra log-concavity of transposed sequences
Derived upper and lower bounds for the ratio of sequence terms
Showed transposed sequences have stronger log-concavity than original sequences
Abstract
The Boros-Moll sequences arise in the study of evaluation of a quartic integral. After the infinite log-concavity conjecture of the sequence was proposed by Boros and Moll, a lot of interesting inequalities on were obtained, although the conjecture is still open. Since has two parameters, it is natural to consider the properties for the sequences , which are called the \emph{transposed Boros-Moll sequences} here. In this paper, we mainly prove the extended reverse ultra log-concavity of the transposed Boros-Moll sequences , and hence give an upper bound for the ratio . A lower bound for this ratio is also established which implies a result stronger than the log-concavity of the 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
TopicsCoding theory and cryptography · Algorithms and Data Compression · Cellular Automata and Applications
