Stable arithmetic regularity in the finite field model

DOI10.1112/BLMS.12211MaRDI QIDQ4629400zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 22 March 2019

Published in Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1710.02021

zbMATH Keywords

arithmetic regularity lemma

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Classification theory, stability, and related concepts in model theory (03C45) Arithmetic combinatorics; higher degree uniformity (11B30)

Abstract: The arithmetic regularity lemma for $mathbb{F}_p^n$, proved by Green in 2005, states that given a subset $Asubseteqmathbb{F}_p^n$, there exists a subspace $Hleqmathbb{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 $Asubseteqmathbb{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.

Recommendations

• Quantitative structure of stable sets in finite abelian groups
• The stable regularity lemma revisited
• An improved lower bound for arithmetic regularity
• Popular progression differences in vector spaces
• Quantitative structure of stable sets in arbitrary finite groups

Cited in

(23)

• A model-theoretic note on the Freiman-Ruzsa theorem
• Stability in a group
• Structure and regularity for subsets of groups with finite VC-dimension
• Keisler's order is not simple (and simple theories may not be either)
• Bounds in Cohen's idempotent theorem
• The stable regularity lemma revisited
• Convolutions of sets with bounded VC-dimension are uniformly continuous
• On finite sets of small tripling or small alternation in arbitrary groups
• Quantitative structure of stable sets in arbitrary finite groups
• NOTES ON THE STABLE REGULARITY LEMMA
• Quantitative structure of stable sets in finite abelian groups
• The coset and stability rings
• Pseudofinite groups and VC-dimension
• A group version of stable regularity
• An improved lower bound for arithmetic regularity
• DOMINATION AND REGULARITY
• Approximate subgroups with bounded VC-dimension
• Complete type amalgamation for nonstandard finite groups
• Model theory and agnostic online learning via excellent sets
• The unstable formula theorem revisited via algorithms
• Higher arity stability and the functional order property
• Supersimplicity and arithmetic progressions
• The VC-dimension of random subsets of finite groups

This page was built for publication: Stable arithmetic regularity in the finite field model

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