arXiv Analytics

Sign in

arXiv:0810.0594 [math.CO]AbstractReferencesReviewsResources

On the Combinatorics of the Boros-Moll Polynomials

William Y. C. Chen, Sabrina X. M. Pang, Ellen X. Y. Qu

Published 2008-10-03Version 1

The Boros-Moll polynomials arise in the evaluation of a quartic integral. The original double summation formula does not imply the fact that the coefficients of these polynomials are positive. Boros and Moll proved the positivity by using Ramanujan's Master Theorem to reduce the double sum to a single sum. Based on the structure of reluctant functions introduced by Mullin and Rota along with an extension of Foata's bijection between Meixner endofunctions and bi-colored permutations, we find a combinatorial proof of the positivity. In fact, from our combinatorial argument one sees that it is essentially the binomial theorem that makes it possible to reduce the double sum to a single sum.

Related articles: Most relevant | Search more
arXiv:math/0310082 [math.CO] (Published 2003-10-06)
The Algebra and Combinatorics of Shuffles and Multiple Zeta Values
arXiv:math/0105072 [math.CO] (Published 2001-05-09, updated 2001-06-21)
Combinatorics of the heat trace on spheres
arXiv:math/9905094 [math.CO] (Published 1999-05-17)
Combinatorics of free cumulants