Inverse Additive Problems for Minkowski Sumsets I

Details Inverse Additive Problems for Minkowski Sumsets I Inverse Additive Problems for Minkowski Sumsets I

2011-05-25

arxiv.org/abs/1105.5153v1

Mathematics

Number Theory

30 pages, submitted

Scientific paper

We give the structure of discrete two-dimensional finite sets $A,\,B\subseteq \R^2$ which are extremal for the recently obtained inequality $|A+B|\ge (\frac{|A|}{m}+\frac{|B|}{n}-1)(m+n-1)$, where $m$ and $n$ are the minimum number of parallel lines covering $A$ and $B$ respectively. Via compression techniques, the above bound also holds when $m$ is the maximal number of points of $A$ contained in one of the parallel lines covering $A$ and $n$ is the maximal number of points of $B$ contained in one of the parallel lines covering $B$. When $m,\,n\geq 2$, 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: $\mu (A+B)\ge (\mu(A)/m+\mu(B)/n)(m+n)$, where $m$ and $n$ are the lengths of the projections of $A$ and $B$ onto a line.

Affiliated with

Also associated with

No associations

Rating

Inverse Additive Problems for Minkowski Sumsets I does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inverse Additive Problems for Minkowski Sumsets I, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inverse Additive Problems for Minkowski Sumsets I will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-216854