OpenAI reports a proof of the Boone–Higman conjecture
- Mathematics
A finitely generated group has decidable word problem if and only if it embeds in a finitely presented simple group.
OpenAI reports a proof of the Boone–Higman conjecture
- Mathematics
A finitely generated group has decidable word problem if and only if it embeds in a finitely presented simple group.
Curated contributions 1
Understand the problem ↓Understanding the problem
Read the background
A finitely generated group has decidable word problem if and only if it embeds in a finitely presented simple group.
Why it matters
If correct, resolves the Boone–Higman conjecture by making the simple overgroup finitely presented.
What counts as progress
Does every finitely generated group with decidable word problem embed in a finitely presented simple group?
Website timeline
Publication dates and editorial changes.