SearcharxivSearch

arXiv · 2509.21566

Cocycle stability in permutations of random simplicial complexes

Abstract

Finding a non-sofic hyperbolic group will resolve two major problems in geometric group theory: Are there non sofic groups? Are there non residually finite hyperbolic groups? In this paper, we propose a new probabilistic approach to this problem, based on the cocycle stability in permutations of random 2-dimensional Linial-Meshulam complexes. Specifically, we study their cocycle stability rate, which measures how far cochains with small coboundaries are from being cocycles. Our main contribution is the following: If, in a middle triangle density range, these random complexes typically have a linear cocycle stability rate, then there exists a non-sofic hyperbolic group. Our proof method is inspired by a well known fact about the non local testability of Sipser-Spielman expander codes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Michael Chapman, Yuval Peled. 2025-09-25. Cocycle stability in permutations of random simplicial complexes. https://arxiv.org/abs/2509.21566

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