# Counting Prime Juggling Patterns

@article{Banaian2016CountingPJ, title={Counting Prime Juggling Patterns}, author={Esther Banaian and S. Butler and C. Cox and J. Davis and Jacob Landgraf and S. Ponce}, journal={Graphs and Combinatorics}, year={2016}, volume={32}, pages={1675-1688} }

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$$b=2 balls we give an expression for the number of prime juggling… CONTINUE READING

3 Citations

Circulant matrices and mathematical juggling

- Mathematics, Computer Science
- Art Discret. Appl. Math.
- 2018

#### References

SHOWING 1-6 OF 6 REFERENCES

The Mathematics of Juggling, Springer-Verlag

- New York,
- 2000