Log-balanced combinatorial sequences

Abstract

We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions for log-balancedness are given for the case when the sequence satisfies a two- (or more-) term linear recurrence. It is shown that many combinatorially interesting sequences belong to this class, and, as a consequence, that the above-mentioned double inequalities are valid for all of them.

24 pages, no figures

References in corpus (1)

• Coherent States from Combinatorial Sequences

Cited by in corpus (6)

• Conjectures involving arithmetical sequences
• Two-log-convexity of the Catalan-Larcombe-French sequence
• On the log-convexity of combinatorial sequences
• Combinatorial proof of the log-convexity for the derangements in the Coxeter groups
• On Ratio Monotonicity of a New Kind of Numbers Conjectured by Z.-W. Sun
• Some Ratio Monotonic Properties of a New Kind of Numbers introduced by Z.-W. Sun