Interlacing Log-concavity of the Boros-Moll Polynomials
William Y. C. Chen, Larry X. W. Wang, Ernest X. W. Xia

TL;DR
This paper introduces the concept of interlacing log-concavity for polynomial sequences, proves that Boros-Moll polynomials possess this property, and provides conditions under which classical combinatorial polynomials are also interlacing log-concave.
Contribution
The paper defines interlacing log-concavity, proves Boros-Moll polynomials have this property, and offers sufficient conditions for other polynomials to be interlacing log-concave.
Findings
Boros-Moll polynomials are interlacing log-concave.
Interlacing log-concavity is a stronger property than log-concavity.
Sufficient conditions are provided for classical combinatorial polynomials to be interlacing log-concave.
Abstract
We introduce the notion of interlacing log-concavity of a polynomial sequence , where is a polynomial of degree m with positive coefficients . This sequence of polynomials is said to be interlacing log-concave if the ratios of consecutive coefficients of interlace the ratios of consecutive coefficients of for any . Interlacing log-concavity is stronger than the log-concavity. We show that the Boros-Moll polynomials are interlacing log-concave. Furthermore we give a sufficient condition for interlacing log-concavity which implies that some classical combinatorial polynomials are interlacing log-concave.
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
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Mathematical Dynamics and Fractals
