The Burnside problem for odd exponents
Agatha Atkarskaya, Eliyahu Rips, Katrin Tent

TL;DR
This paper proves that free Burnside groups with an odd exponent of at least 557 are infinite, using advanced small cancellation theory and introducing a new concept called certification sequences.
Contribution
It establishes the infiniteness of free Burnside groups for a new lower bound of the odd exponent, improving previous results with novel proof techniques.
Findings
Free Burnside groups $B(m,n)$ are infinite for $m extgreater 1$ and odd $n extgreater 557$
Introduces the concept of certification sequences in small cancellation theory
Provides the best known lower bound for the exponent in Burnside groups
Abstract
We show that the free Burnside groups are infinite for and odd , the best currently known lower bound for the exponent. The proof uses iterated small cancellation theory where the induction is based on the nesting depth of relators. The main instrument at every step is a new concept of a certification sequence.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Mathematical Approximation and Integration
