Enumerating (Multiplex) Juggling Sequences
- Author(s): Butler, Steve
- Graham, Ron
- et al.
Published Web Locationhttps://doi.org/10.1007/s00026-009-0040-y
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.