Preprint in the OpenAI Math release
Simple F∞ overgroups of groups with decidable word problem
OpenAI
Abstract
Every finitely generated group with decidable word problem embeds in a simple group of type F. This resolves the higher-finiteness strengthening of the Boone–Higman conjecture.
open until 1 Jan 2028
est. 50% chance this result is independently verified by the end of 2027.
Not verified 50%Verified 50%
What do you think this paper will get?
All positions stay anonymous.
Discussion (0)
Sign in to comment.