Home | People | Seminar | Conferences | Resources

Abstract

Title: Combinatorial proofs of log concavity

Abstract: We combinatorially prove that the number R(n,k) of permutations of length n having k runs is a log-concave sequence in k, for all n. We also give a new combinatorial proof for the log-concavity of the Eulerian numbers.

This is joint work with Richard Ehrenborg


Return to the seminar page.



Home | People | Seminar | Conferences | Resources

Please send comments about this page to Maurice Rojas at rojas@math.tamu.edu.
Last Modified on 07/Apr/00