14.02.2013 Views

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

Gruber P. Convex and Discrete Geometry

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

A Lower Estimate for the Maximum Lattice Packing Density<br />

30 Packing of <strong>Convex</strong> Bodies 449<br />

As a consequence of the Minkowski-Hlawka theorem <strong>and</strong> the inequality of Rogers<br />

<strong>and</strong> Shephard on difference bodies, we obtain the following estimates:<br />

Theorem 30.4. Let C be a proper convex body in E d . Then, as d →∞,<br />

(i) δL(C) ≥ 2 −d if C is centrally symmetric.<br />

(ii) δL(C) ≥ 4 −d+o(d) for general C.<br />

Proof. (i) Let C be an o-symmetric proper convex body. The Minkowski–Hlawka<br />

theorem 24.1 then shows that there are lattices L which contain no point of 2C,<br />

except o <strong>and</strong> with determinant d(L) greater than but arbitrarily close to V (2C). These<br />

lattices provide packings of C where the densities V (C)/d(L) are less than, but<br />

arbitrarily close to, 2−d . This clearly yields δL(C) ≥ 2−d .<br />

(ii) Let C be a proper convex body. Its central symmetrization D = 1 2 (C − C)<br />

then is a proper, o-symmetric convex body. By (i), there are lattices L which provide<br />

packings of D with density V (D)/d(L) arbitrarily close to 2−d . By Proposition 30.3,<br />

each such lattice provides a packing of C where for the density we have<br />

V (C)<br />

d(L)<br />

V (C) V (D)<br />

=<br />

V (D) d(L)<br />

≥ 2d<br />

� 2d<br />

d<br />

�<br />

V (D)<br />

d(L)<br />

by the Rogers–Shephard inequality. Since this is arbitrarily close to<br />

2d �2 −d = 4 −d+o(d) ,<br />

� 2d<br />

d<br />

we obtain δL(C) ≥ 4 −d+o(d) . ⊓⊔<br />

Heuristic Observations<br />

We now extend the heuristic observations in Sect. 24.2. There is reason to believe<br />

that the bound in (i) cannot be improved essentially for certain o-symmetric convex<br />

bodies, perhaps even for Euclidean balls. If this is true, there is a function ψ : N → R<br />

where<br />

ψ(d) = o(d), ψ(d) →∞as d →∞,<br />

such that the following hold: for each d there is an o-symmetric convex body C<br />

in E d with V (2C) = 2 −ψ(d) <strong>and</strong> each lattice L ∈ L(1) contains a point �= o in<br />

the interior of the convex body 2 1+2ψ(d)/d C of volume 2 ψ(d) . Thus, no lattice L ∈<br />

L(1) provides a packing of the convex body 2 2ψ(d)/d C of volume 2 −d+ψ(d) .This<br />

implies that δL(2 2ψ(d)/d C) ≤ 2 −d+ψ(d) . Since the maximum lattice packing density<br />

is invariant with respect to dilatations we have,<br />

δL(C) ≤ 2 −d+ψ(d) .

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!