MathLabs

Open problem, Algebra, posed 1902

Burnside problem

Partially solved

If GG is a finitely generated group in which every element has finite order (the General Burnside Problem), or in which every element g∈Gg \in G satisfies gn=1g^n = 1 for a fixed integer n≥1n \ge 1 (the Bounded Burnside Problem for the free Burnside group B(m,n)B(m, n)), must GG be finite? In the Restricted Burnside Problem, is there a largest finite mm-generated group of exponent nn?

Research frontier as of 2026

As of 2026, while the General Burnside Problem (false) and the Restricted Burnside Problem (true) are completely resolved, the Bounded Burnside Problem remains open for intermediate exponents. Specifically, B(m,n)B(m, n) is known to be finite for m≥2m \ge 2 only when n∈{1,2,3,4,6}n \in \{1, 2, 3, 4, 6\}, and it is a famous open question whether the 22-generator group B(2,5)B(2, 5) of exponent 55 (or B(2,8)B(2, 8) of exponent 88) is finite or infinite.

Best known results

  • The Restricted Burnside Problem holds for all mm and nn: every mm-generated finite group of exponent nn has order bounded by a function f(m,n)f(m, n) (Kostrikin 1958 for prime nn; Zelmanov 1990–1991 for prime-power nn; Hall–Higman 1956 reduction for general nn). For B(2,5)B(2, 5), the largest finite quotient R(2,5)R(2, 5) has order 5345^{34} (Havas, Newman, and Vaughan-Lee 1990).
  • The free Burnside group B(m,n)B(m, n) (m≥2m \ge 2) is finite for n∈{1,2,3,4,6}n \in \{1, 2, 3, 4, 6\} and infinite for all odd n≥665n \ge 665 (Novikov–Adian 1968, Adian 1975) and for large even exponents (Ivanov 1994, Lysenok 1996).

Tools and where they stop

ToolAchievedWhere it stops
Graded Lie algebras and Jordan algebra identitiesBounds the nilpotency class of finite pp-groups of exponent pkp^k by translating group commutators into Engel-like identities in Lie algebras, completely solving the Restricted Burnside ProblemApplies only to residual finiteness (finite quotients) and cannot rule out the existence of an infinite simple or non-residually-finite quotient inside B(2,5)B(2, 5)
Novikov–Adian inductive word analysis and geometric small cancellation (van Kampen diagrams)Controls periodic words across inductive ranks to prove infinitude of B(m,n)B(m, n) for large odd and even exponentsSmall-cancellation curvature estimates break down when the exponent nn is small (such as n=5,7,8n = 5, 7, 8), where overlapping periodic relations interact too tightly

Open questions

  • Is the free Burnside group B(2,5)B(2, 5) of rank 22 and exponent 55 finite (of order 5345^{34}) or infinite?
  • What is the smallest exponent nn for which B(2,n)B(2, n) is infinite?

References

  1. Sergei I. Adian (1979). The Burnside Problem and Identities in Groups
  2. Efim I. Zelmanov (1990). Solution of the restricted Burnside problem for groups of odd exponent · DOI:10.1070/IM1991v036n01ABEH001946
  3. Efim I. Zelmanov (1991). Solution of the restricted Burnside problem for 2-groups · DOI:10.1070/SM1992v072n02ABEH001272
  4. Sergei V. Ivanov (1994). The free Burnside groups of sufficiently large exponents · DOI:10.1142/S0218196794000026