Printable PDF
Department of Mathematics,
Department of Mathematics,
University of California San Diego
****************************
Math 269 - Combinatorics
Jeff Liese
UCSD Graduate Student
Classifying descent and ascents modulo k
Abstract:
Given any fixed integer $k > 1$, one can ask to find formulas for the number of permutations whose descent pairs satisfy certain conditions mod k. We will survey a number of results on these type of questions and we will show that number of remarkable identities emerge from this study.
Host:
February 21, 2006
3:00 PM
AP&M 7321
****************************
