Enumerating (multiplex) juggling sequences

Simple item page
dc.creatorButler, Steve
dc.creatorGraham, Ron
dc.date2008-01-17
dc.date.accessioned2026-07-07T08:54:57Z
dc.date.available2026-07-07T08:54:57Z
dc.descriptionWe consider the problem of enumerating periodic $σ$-juggling sequences of length $n$ for multiplex juggling, where $σ$ is the initial state (or {\em 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 Fan Chung and Ron Graham.
dc.description13 pages; 3 figures; to appear in Annals of Combinatorics
dc.identifierhttps://arxiv.org/abs/0801.2597
dc.identifierhttp://arxiv.org/abs/0801.2597
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146124
dc.subjectCombinatorics
dc.subject00A08; 05A15
dc.titleEnumerating (multiplex) juggling sequences
dc.typetext

Files

Collections

arXiv