Logarithmic behavior of some combinatorial sequences

Simple item page
dc.creatorDošlić, Tomislav
dc.creatorVeljan, Darko
dc.date2006-03-15
dc.date.accessioned2026-07-07T07:06:56Z
dc.date.available2026-07-07T07:06:56Z
dc.descriptionTwo general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic behavior of some combinatorially relevant sequences, such as Motzkin and Schröder numbers, sequences of values of some classic orthogonal polynomials, and many others. The calculus method extends also to two- (or more-) indexed sequences.
dc.description61 page, 6 figures. Submitted to Discrete Mathematics in March 2002
dc.identifierhttps://arxiv.org/abs/math/0603379
dc.identifierhttp://arxiv.org/abs/math/0603379
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/110210
dc.subjectCombinatorics
dc.subject05A20;05A16;05E35;11B83;11B37;11B39;11B68
dc.titleLogarithmic behavior of some combinatorial sequences
dc.typetext

Files

Collections

arXiv