Asymptotic Counting Theorems for Primitive Juggling Patterns

Publication Date

2019

Document Type

Article

Abstract

The mathematics of juggling emerged after the development of siteswap notation in the 1980s. Consequently, much work was done to establish a mathematical theory that describes and enumerates the patterns that a juggler can (or would want to) execute. More recently, mathematicians have provided a broader picture of juggling sequences as an infinite set possessing properties similar to the set of positive integers. This theoretical framework moves beyond the physical possibilities of juggling and instead seeks more general mathematical results, such as an enumeration of juggling patterns with a fixed period and arbitrary number of balls. One problem unresolved until now is the enumeration of primitive juggling sequences, those fundamental juggling patterns that are analogous to the set of prime numbers. By applying analytic techniques to previously-known generating functions, we give asymptotic counting theorems for primitive juggling sequences, much as the prime number theorem gives asymptotic counts for the prime positive integers. © 2019 World Scientific Publishing Company.

Publication Title

International Journal of Number Theory

DOI

10.1142/S1793042119500568

Publisher Policy

pre print, post print (12 month embargo)

This document is currently not available here.

Find in your library

Share

COinS