Calculus proofs of some combinatorial inequalities

Details Calculus proofs of some combinatorial inequalities Calculus proofs of some combinatorial inequalities

2006-03-16

arxiv.org/abs/math/0603405v1

Mathematical Inequalities & Applications 6 (2003) 197-209

Mathematics

Combinatorics

22 pages, no figures

Scientific paper

Using calculus we show how to prove some combinatorial inequalities of the type log-concavity or log-convexity. It is shown by this method that binomial coefficients and Stirling numbers of the first and second kinds are log-concave, and that Motzkin numbers and secondary structure numbers of rank 1 are log-convex. In fact, we prove via calculus a much stronger result that a natural continuous ``patchwork'' (i.e. corresponding dynamical systems) of Motzkin numbers and secondary structures recursions are increasing functions. We indicate how to prove asymptotically the log-convexity for general secondary structures. Our method also applies to show that sequences of values of some orthogonal polynomials, and in particular the sequence of central Delannoy numbers, are log-convex.

Affiliated with

Also associated with

No associations

Rating

Calculus proofs of some combinatorial inequalities 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 Calculus proofs of some combinatorial inequalities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Calculus proofs of some combinatorial inequalities will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-481340