SearcharxivSearch

arXiv · 2608.06222

Nonsofic wreath products of residually finite groups

Abstract

This work builds on the breakthrough of OpenAI in finding the first nonsofic group. We analyze the underlying proof mechanism and find further applications. Let $\Gamma<G$ be such that $\{g\in G:g\Gamma g^{-1}\leq\Gamma\}$ generates $G$ as a group, and suppose that both $\Gamma$ and $G$ have property $(T)$. If $\Gamma$ is not normal, then the generalized wreath product $\bigl(\bigoplus_{G/\Gamma}\mathbb Z/2\mathbb Z\bigr)\rtimes G$ and the group double $G \ast_{\Gamma} G$ are nonsofic. These hypotheses hold for explicit pairs of elementary groups over polynomial and Laurent polynomial rings, in which both groups are residually finite and Kazhdan.

Explore related subjects

Keep this discovery

BibTeXRIS

Gabor Kun, Andreas Thom. 2026-08-06. Nonsofic wreath products of residually finite groups. https://arxiv.org/abs/2608.06222

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