2000 character limit reached
Quantitative structure of stable sets in finite abelian groups
Published 17 May 2018 in math.LO and math.CO | (1805.06847v1)
Abstract: We prove an arithmetic regularity lemma for stable subsets of finite abelian groups, generalising our previous result for high-dimensional vector spaces over finite fields of prime order. A qualitative version of this generalisation was recently obtained by the first author in joint work with Conant and Pillay, using model-theoretic techniques. In contrast, the approach in the present paper is highly quantitative and relies on several key ingredients from arithmetic combinatorics.
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.