Logarithmic behavior of some combinatorial sequences

Details Logarithmic behavior of some combinatorial sequences Logarithmic behavior of some combinatorial sequences

2006-03-15

arxiv.org/abs/math/0603379v1

Mathematics

Combinatorics

61 page, 6 figures. Submitted to Discrete Mathematics in March 2002

Scientific paper

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\"oder numbers, sequences of values of some classic orthogonal polynomials, and many others. The calculus method extends also to two- (or more-) indexed sequences.

Affiliated with

Also associated with

No associations

Rating

Logarithmic behavior of some combinatorial sequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Logarithmic behavior of some combinatorial sequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logarithmic behavior of some combinatorial sequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-728966