Young Mathematicians Resolve 55-Year-Old Juggling-Inspired Conjecture

Key points

• The conjecture, posed in 1971, asks if any set of nonzero integers in a finite cyclic group can be rearranged so that all partial sums are distinct.
• The solution required four separate papers, addressing different cases based on the size of the number set relative to the prime modulus.
• Alp Müyesser and Alexey Pokrovskiy solved the case for large sets using random ordering and spare numbers to fix zero-sum sequences.
• Noah Kravitz and Benjamin Bedert addressed the case for small sets, posting their proof in September 2024.
• Lisa Sauermann and Huy Tuan Pham closed the remaining medium-size case in February 2026 using anti-concentration and Fourier analysis.
• The final proof demonstrated that a random ordering can be adjusted to satisfy the conjecture at least 90% of the time.

Background

Ronald Graham, a renowned mathematician and juggler, posed the conjecture in 1971, likely inspired by the mechanics of juggling where balls must land on distinct beats. The problem remained unsolved for decades due to the complexity of finding valid patterns within rigid constraints. While the solution assumes a very large prime modulus, it confirms that flexible structures exist even in limited number settings.

Why it matters

The resolution demonstrates the power of probabilistic methods and collaboration among young mathematicians to solve long-standing problems in combinatorics. It validates the intuition that flexibility exists even in constrained systems, potentially influencing future research in design theory and symmetric structures.

What to watch

Researchers may explore extending the proof to all prime moduli, not just very large ones. Additionally, the techniques used, particularly anti-concentration and Fourier analysis, may be applied to other unsolved problems in combinatorics and number theory.