Proof of Moll's minimum conjecture
From MaRDI portal
Publication:1940366
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial inequalities (05A20) Arithmetic combinatorics; higher degree uniformity (11B30) Sequences (mod (m)) (11B50) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Abstract: Let denote the coefficients of the Boros-Moll polynomials. Moll's minimum conjecture states that the sequence attains its minimum with . This conjecture is a stronger than the log-concavity conjecture proved by Kausers and Paule. We give a proof of Moll's conjecture by utilizing the spiral property of the sequence , and the log-concavity of the sequence .
Recommendations
Cited in
(12)- Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis
- A short proof of Moll's minimal conjecture
- Partially 2-colored permutations and the Boros-Moll polynomials
- A Computer Proof of Moll’s Log-Concavity Conjecture
- Kreisel's Conjecture with minimality principle
- 2-log-concavity of the Boros-Moll polynomials
- The greatest lower bound of a Boros-Moll sequence
- The concavity and convexity of the Boros-Moll sequences
- A hypergeometric inequality
- Skew log-concavity of the Boros-Moll sequences
- The unimodality of a polynomial coming from a rational integral. Back to the original proof
- Brändén's conjectures on the Boros-Moll polynomials
This page was built for publication: Proof of Moll's minimum conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940366)