Abstract
Motivated by juggling sequences and bubble sort, we examine permutations on the set {1, 2, …, n} with d descents and maximum drop size k. We give explicit formulas for enumerating such permutations for given integers k and d. We also derive the related generating functions and prove unimodality and symmetry of the coefficients.
Original language | English |
---|---|
Title of host publication | DMTCS Proceedings |
Subtitle of host publication | 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010) |
Place of Publication | Nancy, France |
Pages | 247-258 |
Number of pages | 12 |
Volume | AN |
Publication status | Published - 2010 |
Keywords
- Eulerian distribution
- descent polynomial
- drop size
- permutations