Theory of Computing Systems

, Volume 39, Issue 3, pp 425–437 | Cite as

Juggling with Pattern Matching



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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.Computer Science Department, Universite Libre de Bruxelles, B-1050 BrusselsBelgium
  2. 2.Ecole Normale Superieure de Cachan and INRIA Futurs, 61 avenue du President Wilson, 94235 Cachan CedexFrance

Personalised recommendations