Abelian groups are polynomially stable
Preprint
Abstract
In recent years, there has been a considerable amount of interest in stability of equations and their corresponding groups. Here, we initiate the systematic study of the quantitative aspect of this theory. We develop a novel method, inspired by the Ornstein-Weiss quasi-tiling technique, to prove that abelian groups are polynomially stable with respect to permutations, under the normalized Hamming metrics on the groups $\operatorname{Sym}(n)$. In particular, this means that there exists $D\geq 1$ such that for $A,B\in \operatorname{Sym}(n)$, if $AB$ is $\delta$-close to $BA$, then $A$ and $B$ are $\epsilon$-close to a commuting pair of permutations, where $\epsilon\leq O(\delta^{1/D})$. We also observe a property-testing reformulation of this result, yielding efficient testers for certain permutation properties.
Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- C⁎-stability of discrete groupsAdvances in Mathematics, 2020
- STABILITY, COHOMOLOGY VANISHING, AND NONAPPROXIMABLE GROUPSForum of Mathematics, Sigma, 2020
- Group stability and Property (T)Journal of Functional Analysis, 2020
- Stability and invariant random subgroupsDuke Mathematical Journal, 2019
- Stability of group relations under small Hilbert–Schmidt perturbationsJournal of Functional Analysis, 2018
- Sofic representations of amenable groupsProceedings of the American Mathematical Society, 2011
- Making Almost Commuting Matrices CommuteCommunications in Mathematical Physics, 2009
- ALMOST SOLUTIONS OF EQUATIONS IN PERMUTATIONSTaiwanese Journal of Mathematics, 2009
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal latticeCombinatorica, 1990
- Entropy and isomorphism theorems for actions of amenable groupsJournal d'Analyse Mathématique, 1987