Higher-order generalizations of stability and arithmetic regularity

MaRDI QIDQ6381986zbMATH OpenFDO

Authors Caroline A. Terry, J. Wolf

Publication date 2 November 2021

Abstract: We define a natural notion of higher-order stability and show that subsets of $mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic subvarieties up to linear error. This generalizes the arithmetic regularity lemma for stable subsets of $mathbb{F}_p^n$ proved by the authors, as well as subsequent refinements and generalizations by the authors, and Conant, Terry, and Pillay, to the realm of higher-order Fourier analysis.

This page was built for publication: Higher-order generalizations of stability and arithmetic regularity

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