pith. sign in

arxiv: 1805.12374 · v1 · pith:SVP7VPLZnew · submitted 2018-05-31 · 🧮 math.CO · math.NT

A step beyond Freiman's theorem for set addition modulo a prime

classification 🧮 math.CO math.NT
keywords satisfyingdensityfreimanrequirementtheoremadditionallowsarithmetic
0
0 comments X
read the original 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}$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.