Log-balanced combinatorial sequences
组合数学
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0603403,
title = {Log-balanced combinatorial sequences},
author = {Tomislav Došlić},
journal= {arXiv preprint arXiv:math/0603403},
year = {2007}
}
备注
24 pages, no figures