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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
