Log-balanced combinatorial sequences (Q2570959): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 06:53, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Log-balanced combinatorial sequences |
scientific article |
Statements
Log-balanced combinatorial sequences (English)
0 references
31 October 2005
0 references
Summary: 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.
0 references
inequalities
0 references