Skip to main content
Download PDF
- Main
Enumerating (Multiplex) Juggling Sequences
Published Web Location
https://doi.org/10.1007/s00026-009-0040-yAbstract
We consider the problem of enumerating periodic σ-juggling sequences of length n for multiplex juggling, where σ is the initial state (or landing schedule) of the balls. We first show that this problem is equivalent to choosing 1’s in a specified matrix to guarantee certain column and row sums, and then using this matrix, derive a recursion. This work is a generalization of earlier work of Chung and Graham.
Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.