On Doubling and Volume: Chains
Abstract
The well--known Freiman--Ruzsa Theorem provides a structural description of a set A of integers with |2A| c|A| as a subset of a d--dimensional arithmetic progression P with |P| c'|A|, where d and c' depend only on c. The estimation of the constants d and c' involved in the statement has been the object of intense research. Freiman conjectured in 2008 a formula for the largest volume of such a set. In this paper we prove the conjecture for a general class of sets called chains.
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.