2000 character limit reached
A group version of stable regularity
Published 17 Oct 2017 in math.LO and math.CO | (1710.06309v3)
Abstract: We prove that, given $\epsilon>0$ and $k\geq 1$, there is an integer $n$ such that the following holds. Suppose $G$ is a finite group and $A\subseteq G$ is $k$-stable. Then there is a normal subgroup $H\leq G$ of index at most $n$, and a set $Y\subseteq G$, which is a union of cosets of $H$, such that $|A\vartriangle Y|\leq\epsilon|H|$. It follows that, for any coset $C$ of $H$, either $|C\cap A|\leq \epsilon|H|$ or $|C\setminus A|\leq \epsilon|H|$. This qualitatively generalizes recent work of Terry and Wolf on vector spaces over $\mathbb{F}_p$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.