Log-balanced combinatorial sequences (CROSBI ID 128067)
Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija
Podaci o odgovornosti
Došlić, Tomislav
engleski
Log-balanced combinatorial sequences
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.
log-balancedness; log-concavity; log-convexity; integer sequences; recurrences; combinatorial inequalities; Motzkin numbers; Schr\
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
nije evidentirano
Podaci o izdanju
2005 (4)
2005.
507-522-x
objavljeno
0161-1712