Boone--Higman conjecture
A finitely generated group is said to have solvable word problem when an algorithm determines whether each word in a finite generating alphabet represents the identity.
Boone--Higman conjecture. Every finitely generated group with solvable word problem embeds in a finitely presented simple group.
This is a classical embedding conjecture and would give an algebraic characterization of solvability of the word problem. It is known for several families of groups, but remains open in general.
Equivalent formulations
A group has solvable word problem if there is an algorithm deciding whether a word in its generators represents the identity. Boone–Higman conjecture. Every finitely generated group with solvable word problem embeds in a finitely presented simple group. The converse is known, and the conjecture asks whether the two-step Boone–Higman–Thompson embedding can be replaced by a single embedding; it is solved for several important classes of groups but remains open in general.
source: James Belk, Francesco Fournier-Facio, James Hyde and Matthew C. B. Zaremsky, “Boone-Higman embeddings of Aut(F_n) and mapping class groups of punctured surfaces”, arXiv:2503.21882 (2025).
References
- Francesco Fournier-Facio, Xiaolei Wu and Matthew C. B. Zaremsky, “Abstract twisted Brin–Thompson groups”, arXiv:2603.24687 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 3
Claimed by OpenAI. Claims the Boone–Higman conjecture. A finitely generated group has decidable word problem if and only if it embeds in a finitely presented simple group.See full solution
The source claims the finitely generated decidable-word-problem embedding into an ordinarily finitely presented simple group requested by Boone-Higman, together with the converse.
GitHub repository: https://github.com/openai/math
- OpenAI-250-01-Finite-algebraic-envelopes-and-the-Boone-Higman-conjecture.pdfOpen
Claimed by OpenAI. Claims every finitely generated group with decidable word problem embeds in a simple group of type F∞ . This is the claimed higher-finiteness strengthening of the Boone–Higman conjecture.See full solution
This companion strengthens the embedding target to a simple group of type F_infinity, hence finitely presented. Its input remains a finitely generated group with decidable word problem.
GitHub repository: https://github.com/openai/math
- OpenAI-250-02-Simple-F-overgroups-of-groups-with-decidable-word-problem.pdfOpen
Claimed by OpenAI. Claims one group of type F_infinity containing every finitely presented group, whose finitely generated subgroups are exactly the finitely generated recursively presented groups. No simple-target or decidable-word-problem restriction is asserted for this separate higher-dimensional Higman theorem.See full solution
This separate higher-dimensional Higman theorem concerns a universal group of type F_infinity and its finitely generated recursively presented subgroups. It does not assert that the universal target is simple; it is related higher-finiteness embedding progress rather than a replacement for the simple-target Boone-Higman assertion.
GitHub repository: https://github.com/openai/math
- OpenAI-250-03-A-universal-group-of-type-F.pdfOpen