Juggling with Pattern Matching

12 years 3 months ago
Juggling with Pattern Matching
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. We also provide a compact formula for counting the number of transitions of a given length between two juggling states. Chercheur qualifi
Jean Cardinal, Steve Kremer, Stefan Langerman
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2006
Where MST
Authors Jean Cardinal, Steve Kremer, Stefan Langerman
Comments (0)