A robust version of Freiman's $3k-4$ Theorem and applications
Number Theory
2020-03-03 v3 Combinatorics
Abstract
We prove a robust version of Freiman's theorem on the restricted sumset , which applies when the doubling constant is at most in general and at most in the special case when . 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.
Keywords
Cite
@article{arxiv.1711.11060,
title = {A robust version of Freiman's $3k-4$ Theorem and applications},
author = {Xuancheng Shao and Max Wenqiang Xu},
journal= {arXiv preprint arXiv:1711.11060},
year = {2020}
}
Comments
16 pages, references updated