Abelian groups are polynomially stable

DOI10.1093/IMRN/RNAA017MaRDI QIDQ6309110arXivWikidataFDO

Authors Oren Becker, Jonathan Mosheiff

Publication date 1 November 2018

Published in arXiv

Full work available at URL https://doi.org/10.1093/IMRN/RNAA017

Mathematics Subject Classification ID

General theory for infinite permutation groups (20B07) Symmetric groups (20B30) Asymptotic properties of groups (20F69) Algebraic geometry over groups; equations over groups (20F70)

arXiv classification

math.COmath.GR

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 $operatornameSym(n)$. In particular, this means that there exists $Dgeq1$ such that for $A,BinoperatornameSym(n)$, if $AB$ is $delta$-close to $BA$, then $A$ and $B$ are $epsilon$-close to a commuting pair of permutations, where $epsilonleqO(delt{a}^{1/D})$. We also observe a property-testing reformulation of this result, yielding efficient testers for certain permutation properties.

This page was built for publication: Abelian groups are polynomially stable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6309110)