Log-balanced combinatorial sequences
| dc.creator | Došlić, Tomislav | |
| dc.date | 2006-03-16 | |
| dc.date.accessioned | 2026-07-07T07:06:59Z | |
| dc.date.available | 2026-07-07T07:06:59Z | |
| dc.description | 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. | |
| dc.description | 24 pages, no figures | |
| dc.identifier | https://arxiv.org/abs/math/0603403 | |
| dc.identifier | http://arxiv.org/abs/math/0603403 | |
| dc.identifier | International Journal of Mathematics and Mathematical Sciences 2005:4 (2005) 507-522 | |
| dc.identifier | doi:10.1155/IJMMS.2005.507 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/110227 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A20;11B37;11B83;05E35;05B50 | |
| dc.title | Log-balanced combinatorial sequences | |
| dc.type | text |