Quantitative structure of stable sets in finite abelian groups
From MaRDI portal
Publication:5113205
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.
Recommendations
Cites work
- A probabilistic technique for finding almost-periods of convolutions
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- A Szemerédi-type regularity lemma in abelian groups, with applications
- Additive structures in sumsets
- Efficient arithmetic regularity and removal lemmas for induced bipartite patterns
- Groups definable in local fields and pseudo-finite fields
- scientific article; zbMATH DE number 5652361 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- Linear forms and quadratic uniformity for functions on \(\mathbb{Z}_{N}\)
- Model theoretic properties of the Urysohn sphere
- On Roth's theorem on progressions
- On the Bogolyubov-Ruzsa lemma
- On triples in arithmetic progression
- Regularity lemmas for stable graphs
- Roth's theorem for four variables and additive structures in sums of sparse sets
- Stable arithmetic regularity in the finite field model
- Stable groups and expansions of $(\mathbb Z,+,0)$
Cited in
(12)- A model-theoretic note on the Freiman-Ruzsa theorem
- Structure and regularity for subsets of groups with finite VC-dimension
- On arithmetic combinatorics and finite groups
- Convolutions of sets with bounded VC-dimension are uniformly continuous
- Stable arithmetic regularity in the finite field model
- On finite sets of small tripling or small alternation in arbitrary groups
- Quantitative structure of stable sets in arbitrary finite groups
- The stability of finite sets in dyadic groups
- A group version of stable regularity
- Approximate subgroups with bounded VC-dimension
- Is it easy to regularize a hypergraph with easy links?
- Higher arity stability and the functional order property
This page was built for publication: Quantitative structure of stable sets in finite abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113205)