Product-free sets in approximate subgroups of distal groups
Abstract
Recall that a subset X of a group G is 'product-free' if X2 X=, ie if xy X for all x,y∈ X. Let G be a group definable in a distal structure. We prove there are constants c>0 and δ∈(0,1) such that every finite subset X⊂eq G distinct from \1\ contains a product-free subset of size at least δ|X|c+1/|X2|c. In particular, every finite k-approximate subgroup of G distinct from \1\ contains a product-free subset of density at least δ/kc. The proof is short, and follows quickly from Ruzsa calculus and an iterated application of Chernikov and Starchenko's distal regularity lemma.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.