Log‐balanced combinatorial sequences
Open Access
- 1 January 2005
- journal article
- Published by Wiley in International Journal of Mathematics and Mathematical Sciences
- Vol. 2005 (4) , 507-522
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.Keywords
All Related Versions
Funding Information
- Welch Foundation (BD-0894)
This publication has 5 references indexed in Scilit:
- A survey of the Fine numbersDiscrete Mathematics, 2001
- Bell Numbers, Log-Concavity, and Log-ConvexityActa Applicandae Mathematicae, 2000
- Motzkin NumbersEuropean Journal of Combinatorics, 1998
- Some new inequalities for Motzkin numbersMathematical Inequalities & Applications, 1998
- Inductive and injective proofs of log concavity resultsDiscrete Mathematics, 1988