REVIEW
The Burnside problem for odd exponents
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
classification
math.GR
keywords
burnsidebestboundcancellationcertificationconceptcurrentlydepth
Signed reviews
abstract
We show that the free Burnside groups $B(m,n)$ are infinite for $m\geq 2$ and odd $n\geq 557$, 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.
Discussion (0). Continue with ORCID to comment.