Stable arithmetic regularity in the finite-field model

TL;DR

This paper proves a stable version of the arithmetic regularity lemma for subsets of finite fields, showing that under stability assumptions, the regularity bound is polynomial and no non-uniform cosets are needed, unlike the general case.

Contribution

It establishes a polynomial-bound arithmetic regularity lemma for stable subsets of finite fields, removing the tower-type bounds and non-uniform cosets present in the general case.

Findings

Polynomial bound on codimension for stable sets

No non-uniform cosets required in the stable case

Analogue of the stable graph regularity lemma in arithmetic setting

Abstract

The arithmetic regularity lemma for $\mathbb{F}_p^n$, proved by Green in 2005, states that given a subset $A\subseteq \mathbb{F}_p^n$, there exists a subspace $H\leq \mathbb{F}_p^n$ of bounded codimension such that $A$ is Fourier-uniform with respect to almost all cosets of $H$. It is known that in general, the growth of the codimension of $H$ is required to be of tower type depending on the degree of uniformity, and that one must allow for a small number of non-uniform cosets. Our main result is that, under a natural model-theoretic assumption of stability, the tower-type bound and non-uniform cosets in the arithmetic regularity lemma are not necessary. Specifically, we prove an arithmetic regularity lemma for $k$-stable subsets $A\subseteq \mathbb{F}_p^n$ in which the bound on the codimension of the subspace is a polynomial (depending on $k$) in the degree of uniformity, and in which there are no non-uniform cosets. This result is an arithmetic analogue of the stable graph regularity lemma proved by Malliaris and Shelah.