Algebra · Oct 6, 2026
Boone–Higman embeddings with higher finiteness
A finitely generated group has decidable word problem exactly when it embeds in a finitely presented simple group, proving the Boone–Higman conjecture. The target can have type F∞: a classifying space with finitely many cells in each dimension. A single group of type F∞ can also contain every finitely presented group.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model