paper

An arithmetic algebraic regularity lemma

arXiv:2412.11206

Abstract

We give an 'arithmetic regularity lemma' for groups definable in finite fields, analogous to Tao's 'algebraic regularity lemma' for graphs definable in finite fields. More specifically, we show that, for any , any finite field , and any definable group in and definable subset , each of complexity at most , there is a normal definable subgroup , of index and complexity , such that the following holds: for any cosets of , the bipartite graph is -quasirandom. Various analogous regularity conditions follow; for example, for any , the Fourier coefficient is for every non-trivial irreducible representation of .

An arithmetic algebraic regularity lemma · wovepaper