Enumerating multiplex juggling patterns
From MaRDI portal
Abstract: Mathematics has been used in the exploration and enumeration of juggling patterns. In the case when we catch and throw one ball at a time the number of possible juggling patterns is well-known. When we are allowed to catch and throw any number of balls at a given time (known as multiplex juggling) the enumeration is more difficult and has only been established in a few special cases. We give a method of using cards related to "embeddings" of ordered partitions to enumerate the count of multiplex juggling sequences, determine these counts for small cases, and establish some combinatorial properties of the set of cards needed.
Recommendations
Cites work
- Enumerating (Multiplex) juggling sequences
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 1873117 (Why is no real title available?)
- Juggling and applications to \(q\)-analogues
- Juggling and vector compositions
- Juggling card sequences
- Juggling Drops and Descents
Cited in
(10)- Juggling and vector compositions
- Kostant's partition function and magic multiplex juggling sequences
- Juggling card sequences
- Counting prime juggling patterns
- Circulant matrices and mathematical juggling
- Asymptotic counting theorems for primitive juggling patterns
- 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: Enumerating multiplex juggling patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120411)