SearcharxivSearch

arXiv · 2112.10111

Optimal Linear Sofic Approximations Of Countable Groups

Abstract

A countable group G is called k-linear sofic (for some 0 <k \le 1) if finite subsets of G admit "approximate representations" by complex invertible matrices in the normalized rank metric, so that non-identity elements are k-away from the identity. This class of groups was systematically studied by Arzhantseva and Paunescu [AP17], where it is shown that such a group is always 1/4-linear sofic. In this paper, we will study the optimality of this result for general countable groups and show that every linear sofic group is 1/2-linear sofic, and 1/2 cannot be improved. However, if G is assumed to be torsion-free, then it is 1-linear sofic. These results answer a question posed by G. Arzhantseva in her talk in the IAS Stability and Testability lecture series. We also study the optimal linear sofic constant of finite groups over C and fields of positive characteristic. For the proof, we establish effective non-concentration estimates for random walks on finitely generated abelian groups, which may be of independent interest. Another ingredient of the proof involves bounding integrals of certain trigonometric sums.

Explore related subjects

Keep this discovery

BibTeXRIS

Keivan Mallahi-Karai, Maryam Mohammadi Yekta. 2021-12-19. Optimal Linear Sofic Approximations Of Countable Groups. https://doi.org/10.1017/s0017089524000351

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