Counting prime juggling patterns

DOI10.1007/S00373-016-1711-1MaRDI QIDQ343702zbMATH OpenOpenAlexFDO

Authors Esther Banaian, Steve Butler, Christopher Cox, Jeffrey Davis, Jacob Landgraf, Scarlitte Ponce

Publication date 29 November 2016

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1508.05296

zbMATH Keywords

asymptoticsenumerationjugglingpartitionsstate graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: Juggling patterns can be described by a closed walk in a (directed) state graph, where each vertex (or state) is a landing pattern for the balls and directed edges connect states that can occur consecutively. The number of such patterns of length $n$ is well known, but a long-standing problem is to count the number of prime juggling patterns (those juggling patterns corresponding to cycles in the state graph). For the case of $b=2$ balls we give an expression for the number of prime juggling patterns of length $n$ by establishing a connection with partitions of $n$ into distinct parts. From this we show the number of two-ball prime juggling patterns of length $n$ is $(gamma-o(1))2^n$ where $gamma=\mathrm{1.32963879259...}$. For larger $b$ we show there are at least $b^{n-1}$ prime cycles of length $n$.

Recommendations

• Primitive Juggling Sequences
• Asymptotic counting theorems for primitive juggling patterns
• Enumerating multiplex juggling patterns
• Universal juggling cycles
• Enumerating (Multiplex) juggling sequences

Cites work

• Enumerating (Multiplex) juggling sequences
• scientific article; zbMATH DE number 1873117 (Why is no real title available?)
• scientific article; zbMATH DE number 2108625 (Why is no real title available?)
• Juggling card sequences
• Primitive Juggling Sequences

Cited in

(11)

• Juggling card sequences
• Enumerating multiplex juggling patterns
• Primitive Juggling Sequences
• Randomly juggling backwards
• Circulant matrices and mathematical juggling
• Asymptotic counting theorems for primitive juggling patterns
• Universal juggling cycles
• Enumerating (Multiplex) juggling sequences
• Passing drops and descents
• Enumeration of multiplex juggling card sequences using generalized q-derivatives
• Juggling with pattern matching

This page was built for publication: Counting prime juggling patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343702)