2000 character limit reached
Progress around the Boone-Higman Conjecture
Published 28 Jun 2023 in math.GR | (2306.16356v3)
Abstract: A conjecture of Boone and Higman from the 1970's asserts that a finitely generated group has solvable word problem if and only if can be embedded into a finitely presented simple group. We comment on the history of this conjecture and survey recent results that establish the conjecture for many large classes of interesting groups.
Paper Prompts
Sign up for free to create and run prompts on this paper.