Juggling with Pattern Matching
Jean Cardinal, Steve Kremer, and Stefan Langerman. Juggling with Pattern Matching. Theory of Computing Systems, 39(3):425–437, Springer, June 2006.
doi:10.1007/s00224-005-1239-x
Download
Abstract
In the late eighties, 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.
BibTeX
@article{CardinalKremerLangerman2005, abstract = {In the late eighties, 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.}, author = {Cardinal, Jean and Kremer, Steve and Langerman, Stefan}, DOI = {10.1007/s00224-005-1239-x}, journal = {Theory of Computing Systems}, month = jun, number = {3}, pages = {425-437}, publisher = {Springer}, title = {Juggling with Pattern Matching}, volume = {39}, year = {2006}, nmonth = {6}, url = {http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/jwpm-journal.pdf}, }