A robust version of Freiman's 3k-4 Theorem and applications
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:3D6P5IA5record.jsonopen to challenge →
classification
math.NT
math.CO
keywords
robustapplicationsfreimantheoremversionwhenalmostapplies
read the original abstract
We prove a robust version of Freiman's $3k - 4$ theorem on the restricted sumset $A+_{\Gamma}B$, which applies when the doubling constant is at most $\tfrac{3+\sqrt{5}}{2}$ in general and at most $3$ in the special case when $A = -B$. As applications, we derive robust results with other types of assumptions on popular sums, and structure theorems for sets satisfying almost equalities in discrete and continuous versions of the Riesz-Sobolev inequality.
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.