Counting prime juggling patterns

From MaRDI portal
Publication:343702

DOI10.1007/S00373-016-1711-1zbMATH Open1351.05115arXiv1508.05296OpenAlexW1876545520MaRDI QIDQ343702FDOQ343702

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

Publication date: 29 November 2016

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

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 (gammao(1))2n where gamma=1.32963879259.... For larger b we show there are at least bn1 prime cycles of length n.


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




Recommendations




Cites Work


Cited In (2)





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)