The Burnside problem for relatively small odd exponents
The Burnside problem asks if finitely generated groups with identity x^n = 1 are necessarily finite. In general, the answer is negative if the exponent n is large enough. The first negative solution for odd n at least 4381 was given by Novikov and Adian in 1968. Using different methods, this result was also proved by Olshanskii in 1982 for n > 10^10. The proof of Novikov and Adian is combinatorial, while the proof of Olshanskii is based on geometric considerations. We present a proof of the Burnside problem for odd exponents based on new combinatorial ideas, which is relatively short and works for relatively small odd exponents.
Joint work with E. Rips and K. Tent.
תאריך עדכון אחרון : 28/11/2022