Abstract
In the late 1980s it was shown that juggling patterns can be described by strings of numbers with fascinating combinatorial properties that have since then been studied by many mathematicians and computer scientists. In this paper we propose to study juggling patterns from a pattern matching point of view. Inspired by pattern matching algorithms based on convolution, we propose a fast algorithm for finding transitions between juggling states. Apart from being a fun application of pattern matching theory, it provides a practical tool in the experimental design of (large) juggling patterns. We also provide a compact formula for counting the number of transitions of a given length between two juggling states.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Cardinal, J., Kremer, S. & Langerman, S. Juggling with Pattern Matching. Theory Comput Syst 39, 425–437 (2006). https://doi.org/10.1007/s00224-005-1239-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-005-1239-x