Inverse Additive Problems for Minkowski Sumsets I
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.
Cite
@article{arxiv.1105.5153,
title = {Inverse Additive Problems for Minkowski Sumsets I},
author = {G. A. Freiman and D. Grynkiewicz and O. Serra and Y. V. Stanchescu},
journal= {arXiv preprint arXiv:1105.5153},
year = {2013}
}
Comments
30 pages, submitted