2000 character limit reached
A step beyond Freiman's theorem for set addition modulo a prime
Published 31 May 2018 in math.CO and math.NT | (1805.12374v1)
Abstract: Freiman's 2.4-Theorem states that any set $A \subset \mathbb{Z}_p$ satisfying $|2A| \leq 2.4|A| - 3 $ and $|A| < p/35$ can be covered by an arithmetic progression of length at most $|2A| - |A| + 1$. A more general result of Green and Ruzsa implies that this covering property holds for any set satisfying $|2A| \leq 3|A| - 4$ as long as the rather strong density requirement $|A| < p/10{215}$ is satisfied. We present a version of this statement that allows for sets satisfying $|2A| \leq 2.48|A| - 7$ with the more modest density requirement of $|A| < p/10{10}$.
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.