Proof of Moll's minimum conjecture
DOI10.1016/J.EJC.2012.11.002zbMATH Open1259.05021arXiv0904.0841OpenAlexW2007352672WikidataQ123250076 ScholiaQ123250076MaRDI QIDQ1940366FDOQ1940366
William Y. C. Chen, Ernest X. W. Xia
Publication date: 6 March 2013
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0904.0841
Recommendations
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)
Cited In (10)
- A hypergeometric inequality
- The unimodality of a polynomial coming from a rational integral. Back to the original proof
- 2-Log-Concavity of the Boros–Moll Polynomials
- A Computer Proof of Moll’s Log-Concavity Conjecture
- A short proof of Moll's minimal conjecture
- Skew log-concavity of the Boros-Moll sequences
- Partially 2-colored permutations and the Boros-Moll polynomials
- Kreisel's Conjecture with minimality principle
- Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis
- The concavity and convexity of the Boros-Moll sequences
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)