Boone--Higman conjecture
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.