Two-log-convexity of the Catalan-Larcombe-French sequence
Brian Yi Sun, Baoyindureng Wu

TL;DR
This paper proves that the Catalan-Larcombe-French sequence is strictly 2-log-convex by applying a criterion for 2-log-convexity to a related sequence, extending understanding of its convexity properties.
Contribution
The paper introduces a new proof that the Catalan-Larcombe-French sequence is strictly 2-log-convex using a criterion for sequences satisfying three-term recurrence relations.
Findings
The sequence is strictly 2-log-convex.
The sequence $oxed{P^2_n - P_{n-1} P_{n+1}}$ is strictly log-convex.
The sequence is log-balanced.
Abstract
The Catalan-Larcombe-French sequence arises in a series expansion of the complete elliptic integral of the first kind. It has been proved that the sequence is log-balanced. In the paper, by exploring a criterion due to Chen and Xia for testing 2-log-convexity of a sequence satisfying three-term recurrence relation, we prove that the new sequence are strictly log-convex and hence the Catalan-Larcombe-French sequence is strictly 2-log-convex.
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.
