2000 character limit reached
2-Log-concavity of the Boros-Moll Polynomials
Published 3 Oct 2010 in math.CO and math.CA | (1010.0416v1)
Abstract: The Boros-Moll polynomials $P_m(a)$ arise in the evaluation of a quartic integral. It has been conjectured by Boros and Moll that these polynomials are infinitely log-concave. In this paper, we show that $P_m(a)$ is 2-log-concave for any $m\geq 2$. Let $d_i(m)$ be the coefficient of $ai$ in $P_m(a)$. We also show that the sequence ${i (i+1)(d_i{\,2}(m)-d_{i-1}(m)d_{i+1}(m))}_{1\leq i \leq m}$ is log-concave. This leads another proof of Moll's minimum conjecture.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.