Abstract — v1

We construct a 33-generator 99-relator group with unsolvable word problem. We use the group to construct two fixed-size Adian–Rabin families of group presentations, one with 44 generators and 1111 relators, and another with 22 generators and 1010 relators. As a consequence, #7(S2×S2)\#_7(S^2\times S^2) is topologically unrecognizable and #9(S2×S2)\#_9(S^2\times S^2) is smoothly unrecognizable. These algebraic and topological results improve the previous best known bounds by Borisov, Tancer, and Gordon. The construction of the group builds upon an example of Borisov and uses additional HNN extensions and Tietze eliminations to reduce the size of the presentation. We also provide a machine-checked Lean~4 formalization of the algebraic results.

Review conversation

No reviews from the Hub API for this paper.