A generic approach to proving Tur\'{a}n-type inequalities for sequences that admit exact formulas, with an application to unimodal sequences
Koustav Banerjee, Kathrin Bringmann, and Ben Kane

TL;DR
This paper develops a general method to prove Turán-type inequalities for sequences with explicit formulas, applying it to unimodal sequences and establishing inequalities for large n.
Contribution
It introduces a generic approach for proving Turán inequalities for sequences with exact formulas, demonstrated on unimodal sequences.
Findings
Proves that the number of unimodal sequences satisfies higher order Turán inequalities for n ≥ 33.
Establishes positivity of certain second j-shifted differences of u(n).
Provides an asymptotic expansion with error bounds for u(n).
Abstract
We derive an asymptotic expansion with effective error bound for , counting the number of unimodal sequences of size . We prove that satisfies the higher order Tur\'{a}n inequalities for and that certain second -shifted difference of are positive.
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
Topicsgraph theory and CDMA systems · Mathematical Approximation and Integration · Mathematical Inequalities and Applications
