Logarithmic behavior of some combinatorial sequences
Abstract
Description
Two 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.
61 page, 6 figures. Submitted to Discrete Mathematics in March 2002
61 page, 6 figures. Submitted to Discrete Mathematics in March 2002