Inequalities for the lattice width of lattice-free convex sets in the plane

Details Inequalities for the lattice width of lattice-free convex sets in the plane Inequalities for the lattice width of lattice-free convex sets in the plane

2010-03-23

arxiv.org/abs/1003.4365v2

Mathematics

Metric Geometry

to appear in Beitr\"age Algebra Geom

Scientific paper

A closed, convex set $K$ in $\mathbb{R}^2$ with non-empty interior is called lattice-free if the interior of $K$ is disjoint with $\mathbb{Z}^2$. In this paper we study the relation between the area and the lattice width of a planar lattice-free convex set in the general and centrally symmetric case. A correspondence between lattice width on the one hand and covering minima on the other, allows us to reformulate our results in terms of covering minima introduced by Kannan and Lov\'asz. We obtain a sharp upper bound for the area for any given value of the lattice width. The lattice-free convex sets satisfying the upper bound are characterized. Lower bounds are studied as well. Parts of our results are applied in a paper by the authors and Weismantel for cutting plane generation in mixed integer linear optimization, which was the original inducement for this paper. We further rectify a result of Kannan and Lov\'asz with a new proof.

Affiliated with

Also associated with

No associations

Rating

Inequalities for the lattice width of lattice-free convex sets in the plane 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 Inequalities for the lattice width of lattice-free convex sets in the plane, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inequalities for the lattice width of lattice-free convex sets in the plane will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-211154