Log-balanced combinatorial sequences (Q2570959): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: math/0603403 / rank | |||
Normal rank |
Latest revision as of 08:11, 19 April 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