A robust version of Freiman's 3k-4 Theorem and applications

Abstract

We prove a robust version of Freiman's 3k - 4 theorem on the restricted sumset A+B, which applies when the doubling constant is at most 3+52 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.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…