Additive volume of sets contained in few arithmetic progressions
From MaRDI portal
Abstract: A conjecture of Freiman gives an exact formula for the largest volume of a finite set of integers with given cardinality and doubling . The formula is known to hold when , for some small range over and for families of structured sets called chains. In this paper we extend the formula to sets of every dimension and prove it for sets composed of three segments, giving structural results for the extremal case. A weaker extension to sets composed of a bounded number of segments is also discussed.
Recommendations
Cites work
- A generalization of Freiman's 3k-3 Theorem
- Combinatorics and linear algebra of Freiman's isomorphism
- Detailed structure for Freiman's 3k - 3 theorem
- Freiman's inverse problem with small doubling property
- Generalized arithmetical progressions and sumsets
- scientific article; zbMATH DE number 4014838 (Why is no real title available?)
- scientific article; zbMATH DE number 3425719 (Why is no real title available?)
- scientific article; zbMATH DE number 1315258 (Why is no real title available?)
- Inverse Additive Number Theory. XI. Long arithmetic progressions in sets with small sumsets
- Inverse additive problems for Minkowski sumsets. I
- Near optimal bounds in Freiman's theorem
- On addition of two distinct sets of integers
- On addition of two distinct sets of integers
- On the simplest inverse problem for sums of sets in several dimensions
- The structure of d-dimensional sets with small sumset
This page was built for publication: Additive volume of sets contained in few arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383292)