Abstract
Let be a triangular array of numbers. We say that is skew log-concave if for any fixed n, the sequence is log-concave. In this paper, we show that the Boros-Moll sequences are almost skew log-concave.
Keywords: log-concavity, skew log-concavity, the Boros-Moll sequence
Introduction and main result
Boros and Moll [1, 2] explored a special class of Jacobi polynomials in their study of a quartic integral. They have shown that for any and any nonnegative integer m,
where
| 1.1 |
Using Ramanujan’s master theorem, Boros and Moll [2] derived the following formula for :
| 1.2 |
which implies that the coefficient of in is positive for . Let be given by
| 1.3 |
The polynomial is called the Boros-Moll polynomial, and the sequence of the coefficients is called a Boros-Moll sequence. From (1.3), we know that can be given by
| 1.4 |
Some combinatorial properties of have been proved. Boros and Moll [1] proved that the sequence is unimodal, and the maximum element appears in the middle. Recall that a sequence of real numbers is said to be unimodal if there exists an index such that
and is said to be log-concave if
| 1.5 |
where . Moll [2] conjectured that the sequence is log-concave. Kauers and Paule [3] proved this conjecture based on recurrence relations found using a computer algebra approach. Recently, Chen and Xia [4] showed that the sequence satisfies the strongly ratio monotone property which implies the log-concavity and the spiral property. They [5] also confirmed a conjecture of Moll which says that attains its minimum at . Chen et al. [6] proved that the Boros-Moll sequences are interlacing log-concave. Chen and Gu [7] showed that the sequence satisfies the reverse ultra log-concavity. Chen and Xia [8] proved that the Boros-Moll sequences are 2-log-concave, and Xia [9] studied the concavity and convexity of the Boros-Moll sequences.
In this paper, we give a new definition, i.e., skew log-concavity. Let be a triangular array of numbers. We say that is skew log-concave if for any fixed n, the sequence is log-concave. We will show that the Boros-Moll sequences are almost skew log-concave.
The main results of this paper can be stated as follows.
Theorem 1.1
Let be defined by (1.4). We have, for any fixed ,
| 1.6 |
and
| 1.7 |
Proof of Theorem 1.1
From (1.4), we see that , which implies that (1.7) holds.
By (1.4),
which yields
Therefore, (1.6) holds when .
Hence, in the following, we always assume that and . We first recall the following three recurrence relations derived by Kauers and Paule [3]:
| 2.1 |
| 2.2 |
and
| 2.3 |
Now we represent the difference in terms of and . Thanks to (2.1), (2.2) and (2.3),
| 2.4 |
where
| 2.5 |
| 2.6 |
| 2.7 |
with
| 2.8 |
| 2.9 |
It is easy to check that
where
Note that A is positive. Hence, in order to prove that the right-hand side of (2.4) is positive, it suffices to prove that when Δ is nonnegative,
| 2.10 |
Therefore, in the following, we assume that .
Recall that Kauers and Paule [3] proved the following inequality:
Replacing m by , we see that
| 2.11 |
It is a routine to verify that
| 2.12 |
where
Note that when and , G is positive. Thus the right-hand side of (2.12) is positive. On the other hand,
which is positive. Therefore, from (2.12), we have
which can be rewritten as
| 2.13 |
From (2.11) and (2.13), we obtain (2.10) and this completes the proof.
Acknowledgements
This work was supported by the National Science Foundation of China (11526136, 11501356).
Footnotes
Competing interests
The author declares that they have no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
References
- 1.Boros G, Moll VH. A sequence of unimodal polynomials. J. Math. Anal. Appl. 1999;237:272–285. doi: 10.1006/jmaa.1999.6479. [DOI] [Google Scholar]
- 2.Moll VH. The evaluation of integrals: a personal story. Not. Am. Math. Soc. 2002;49(3):311–317. [Google Scholar]
- 3.Kausers M, Paule P. A computer proof of Moll’s log-concavity conjecture. Proc. Am. Math. Soc. 2007;135(12):3847–3856. doi: 10.1090/S0002-9939-07-08912-5. [DOI] [Google Scholar]
- 4.Chen WYC, Xia EXW. The ratio monotonicity of Boros-Moll polynomials. Math. Comput. 2009;78:2269–2282. doi: 10.1090/S0025-5718-09-02223-6. [DOI] [Google Scholar]
- 5.Chen WYC, Xia EXW. A proof of Moll’s minimum conjecture. Eur. J. Comb. 2013;34:787–791. doi: 10.1016/j.ejc.2012.11.002. [DOI] [Google Scholar]
- 6.Chen WYC, Wang LXW, Xia EXW. The interlacing log-concavity of Boros-Moll polynomials. Pac. J. Math. 2011;254:89–99. doi: 10.2140/pjm.2011.254.89. [DOI] [Google Scholar]
- 7.Chen WYC, Gu CCY. The reverse ultra log-concavity of the Boros-Moll polynomials. Proc. Am. Math. Soc. 2009;137:3991–3998. doi: 10.1090/S0002-9939-09-09976-6. [DOI] [Google Scholar]
- 8.Chen WYC, Xia EXW. 2-log-concavity of the Boros-Moll polynomials. Proc. Edinb. Math. Soc. 2013;56:701–722. doi: 10.1017/S0013091513000412. [DOI] [Google Scholar]
- 9.Xia EXW. The concavity and convexity of the Boros-Moll sequences. Electron. J. Comb. 2015;22 [Google Scholar]
