A criterion for the log-convexity of combinatorial sequences
type: Item
instance of: scholarly article
title: A criterion for the log-convexity of combinatorial sequences
zbMATH Open document ID: 1298.05041
author: Ernest X. W. Xia
author: Olivia X. M. Yao
published in: The Electronic Journal of Combinatorics
publication date: 2014-08-14T00:00:00Z
full work available at URL: v20i4p3
review text: Summary: Recently, \textit{T. Došlić} [Int. J. Math. Math. Sci. 2005, No. 4, 507--522 (2005; Zbl 1073.05005); J. Math. Inequal. 3, No. 3, 437--442 (2009; Zbl 1230.05046)], and \textit{L. L. Liu} and \textit{Y. Wang} [Adv. Appl. Math. 39, No. 4, 453--476 (2007; Zbl 1131.05010)] developed techniques for dealing with the log-convexity of sequences. In this paper, we present a criterion for the log-convexity of some combinatorial sequences. In order to prove the log-convexity of a sequence satisfying a three-term recurrence, by our method, it suffices to compute a constant number of terms at the beginning of the sequence. For example, in order to prove the log-convexity of the Apéry numbers \(A_n\), by our method, we just need to evaluate the values of \(A_n\) for \(0\leq n \leq 6\). As applications, we prove the log-convexity of some famous sequences including the Catalan-Larcombe-French numbers. This confirms a conjecture given by \textit{Z. W. Sun} [Ser. Number Theory Appl. 8, 244--258 (2013; Zbl 1308.11031)].
Mathematics Subject Classification ID: 05A20
Mathematics Subject Classification ID: 11B83
Mathematics Subject Classification ID: 11B73
zbMATH DE Number: 6330334
zbMATH Keywords: log-convexity
zbMATH Keywords: three-term recurrence
zbMATH Keywords: combinatorial sequences
describes a project that uses: OEIS
MaRDI profile type: Publication
cites work: Q4184941
cites work: The 2-log-convexity of the Apéry Numbers
cites work: Log-balanced combinatorial sequences
cites work: Q3405643
cites work: Seven (lattice) paths to log-convexity
cites work: Logarithmic behavior of some combinatorial sequences
cites work: On the average rank of an element in a filter of the partition lattice
cites work: A classic proof of a recurrence for a very classical sequence
cites work: Q4510684
cites work: The enumeration of tree-like polyhexes
cites work: On the ``other'' Catalan numbers: A historical formulation re-examined
cites work: Positivity of three-term recurrence sequences
cites work: On the log-convexity of combinatorial sequences
cites work: Q4430852
cites work: Q4443440
cites work: Bijective recurrences concerning Schröder paths
cites work: CONJECTURES INVOLVING ARITHMETICAL SEQUENCES
cites work: The signs of three-term recurrence sequences
cites work: Q3655906
Recommended article: On the log-convexity of combinatorial sequences
Recommended article: Q3405643
Recommended article: A combinatorial proof of the log-convexity of sequences in Riordan arrays
Recommended article: Q5263407
Recommended article: Q5879754
Recommended article: Q5133047
Recommended article: Log-concavity of \(P\)-recursive sequences
Recommended article: On log concave sequences
Recommended article: Q5149466
Recommended article: A combinatorial proof of the log-concavity of a famous sequence counting permutations
description: scientific article; zbMATH DE number 6330334