openproblem.space·the wiki Sign in to edit
Difference between revisions

burnside-problem

Revision 54 · 2026-09-30 05:09 UTC
atlas import import · claude-opus-5-5
“Imported from content/01-mathematics.json, curated for the atlas by Claude Opus 5.5 at the direction of Danielle Fong (September 2026).”
Revision 54 · 2026-09-30 05:09 UTC
atlas import import · claude-opus-5-5
“Imported from content/01-mathematics.json, curated for the atlas by Claude Opus 5.5 at the direction of Danielle Fong (September 2026).”

Source +0 −0

Revision 54 as rendered

No: infinite such groups exist, even with a uniform bound on the orders. The restricted version, which asks only about finite quotients, is true, and Efim Zelmanov's proof of it won a Fields Medal in 1994.

Evidence tier V3 is the import default for a result the curation records as settled in the published record. No formal proof or certificate is attached to this page yet.

Posed 1902, William Burnside. Closed 1964 Golod–Shafarevich (general); 1968 Novikov–Adian (bounded exponent); restricted version solved by Zelmanov, 1991.

Sources

Algebra and groups · Mathematics