SearcharxivSearch

arXiv · 2609.10461

Small undecidable groups and unrecognizable 4-manifolds

Abstract

We construct a $3$-generator $9$-relator group with unsolvable word problem. We use the group to construct two fixed-size Adian--Rabin families of group presentations, one with $4$ generators and $11$ relators, and another with $2$ generators and $10$ relators. As a consequence, $\#_7(S^2\times S^2)$ is topologically unrecognizable and $\#_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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marc Kegel, Shana Yunsheng Li, Qiuyu Ren. 2026-09-09. Small undecidable groups and unrecognizable 4-manifolds. https://arxiv.org/abs/2609.10461

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR