2000 character limit reached
The abelian arithmetic regularity lemma (1606.09303v1)
Published 29 Jun 2016 in math.NT and math.CO
Abstract: We give a brief exposition and proof of the arithmetic regularity lemma of Green and Tao in the abelian ($U2$) case, over ${1,\dots,N}$. This may be useful to those who need just the $U2$ case of the lemma, as the general case is significantly more involved. It may also be useful as an introduction to the general case. No originality is claimed.
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.