A sample iterated small cancellation theory for groups of Burnside type
Igor Lysenok

TL;DR
This paper introduces a new method to present free Burnside groups of odd exponent using iterated small cancellation conditions, providing an accessible proof of their infiniteness for exponents greater than 2000.
Contribution
It develops a novel technique for representing Burnside groups with small cancellation conditions and offers a simplified proof of their infiniteness for large odd exponents.
Findings
Proves that free Burnside groups are infinite for odd exponents n > 2000.
Introduces an iterated small cancellation approach for Burnside groups.
Provides an accessible proof compared to previous complex methods.
Abstract
We develop yet another technique to present the free Burnside group of odd exponent with generators as a group satisfying a certain iterated small cancellation condition. Using the approach, we provide a reasonably accessible proof that is infinite with a moderate bound on the odd exponent .
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
TopicsGeometric and Algebraic Topology · Finite Group Theory Research · Advanced Topology and Set Theory
