Asymptotic counting theorems for primitive juggling patterns

DOI10.1142/S1793042119500568zbMATH Open1459.11074OpenAlexW3162694374MaRDI QIDQ5380762FDOQ5380762

Authors: Erik R. Tou 

Publication date: 6 June 2019

Published in: International Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793042119500568

Recommendations

• Counting prime juggling patterns
• Primitive Juggling Sequences
• Enumerating multiplex juggling patterns
• Enumerating (Multiplex) juggling sequences
• Juggling Drops and Descents

zbMATH Keywords

jugglinganalytic number theoryRouché's theorem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other combinatorial number theory (11B75) Asymptotic results on arithmetic functions (11N37) Generalized primes and integers (11N80)

Cites Work

• Analytic combinatorics
• A concrete approach to classical analysis
• Counting prime juggling patterns
• Primitive Juggling Sequences
• Title not available (Why is that?)
• A zeta function for juggling sequences

Cited In (9)

• Juggling with pattern matching
• Extending Shannon's Theorem to a General Juggling Pattern
• Juggling and applications to \(q\)-analogues
• Enumerating multiplex juggling patterns
• Primitive Juggling Sequences
• Title not available (Why is that?)
• Counting prime juggling patterns
• Enumerating (Multiplex) juggling sequences
• A zeta function for juggling sequences

This page was built for publication: Asymptotic counting theorems for primitive juggling patterns

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