Inverse additive problems for Minkowski sumsets. I
From MaRDI portal
(Redirected from Publication:1956302)
Additive bases, including sumsets (11B13) Arithmetic combinatorics; higher degree uniformity (11B30) Inverse problems of additive number theory, including sumsets (11P70) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Abstract: We give the structure of discrete two-dimensional finite sets which are extremal for the recently obtained inequality , where and are the minimum number of parallel lines covering and respectively. Via compression techniques, the above bound also holds when is the maximal number of points of contained in one of the parallel lines covering and is the maximal number of points of contained in one of the parallel lines covering . When , we are able to characterize the case of equality in this bound as well. We also give the structure of extremal sets in the plane for the projection version of Bonnesen's sharpening of the Brunn-Minkowski inequality: , where and are the lengths of the projections of and onto a line.
Recommendations
Cites work
- A Brunn-Minkowski inequality for the integer lattice
- COMPRESSIONS, CONVEX GEOMETRY AND THE FREIMAN–BILU THEOREM
- Convex Analysis
- scientific article; zbMATH DE number 3425719 (Why is no real title available?)
- scientific article; zbMATH DE number 4022030 (Why is no real title available?)
- scientific article; zbMATH DE number 3632542 (Why is no real title available?)
- scientific article; zbMATH DE number 933467 (Why is no real title available?)
- Inverse additive problems for Minkowski sumsets. II
- On the structure of sets with small doubling property on the plane (I)
- On the structure of sets with small doubling property on the plane. II.
- Properties of two-dimensional sets with small sumset
- Sum of sets in several dimensions
- Sums in the grid
- The Brunn-Minkowski inequality
Cited in
(7)- Inverse additive problems for Minkowski sumsets. II
- Minimising the sum of projections of a finite set
- A note on triangulations of sumsets
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Some results about Minkowski addition and difference
- Remarks on the equality case of the Bonnesen inequality
- Additive volume of sets contained in few arithmetic progressions
This page was built for publication: Inverse additive problems for Minkowski sumsets. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1956302)