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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

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

Next, given a convex body C <strong>and</strong> a discrete set T , consider the family {C + t :<br />

t ∈ T } of translates of C by the vectors of T .Itsupper <strong>and</strong> lower density are<br />

lim sup<br />

τ→+∞<br />

1<br />

(2τ) d<br />

�<br />

V � (C + t) ∩ τ K � 1<br />

, lim inf<br />

τ→+∞ (2τ) d<br />

�<br />

V � (C + t) ∩ τ K � .<br />

t∈T<br />

If they coincide, their common value is called the density δ(C, T ) of the given family.<br />

In other sources different definitions are used. For packings <strong>and</strong> coverings with<br />

translates of a convex body, these amount to the same values for the upper <strong>and</strong> lower<br />

densities. For more general families of convex bodies our definitions are still close to<br />

the intuitive notion of density <strong>and</strong> avoid strange occurrences such as packings with<br />

upper density +∞.<br />

Roughly speaking, the density of a family {C + t : t ∈ T } of translates of C<br />

by the vectors of T is the total volume of the bodies divided by the total volume of<br />

E d . In the case where this family is a packing, the density may be considered as the<br />

proportion of E d which is covered by the bodies of the packing, or as the probability<br />

that a ‘r<strong>and</strong>om point’ of E d is contained in one of the bodies of the packing.<br />

Given a convex body C, letδT (C) <strong>and</strong> δL(C) denote the supremum of the upper<br />

densities of all packings of translates of C, <strong>and</strong> all lattice packings of C, respectively.<br />

δT (C) <strong>and</strong> δL(C) are called the (maximum) translative packing density <strong>and</strong><br />

the (maximum) lattice packing density of C, respectively. Clearly,<br />

0 0 such that:<br />

(1) F ⊆ σ K .<br />

For the proof of the proposition, it is sufficient to show that<br />

(2) 2d (τ − σ) d<br />

d(L)<br />

≤ #(L ∩ τ K ) ≤ 2d (τ + σ) d<br />

d(L)<br />

t∈T<br />

for τ>σ.<br />

The parallelotopes {F + l : l ∈ L} are pairwise disjoint <strong>and</strong> cover E d . Thus the<br />

parallelotopes in this family which intersect τ K ,infact,coverτ K . By (1) these<br />

parallelotopes are all contained in (τ + σ)K . Thus if m is their number, we have<br />

#(L ∩ τ K ) ≤ m = mV(F)<br />

V (F) ≤ V � (τ + σ)K �<br />

V (F)<br />

= 2d (τ + σ) d<br />

.<br />

d(L)

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

Saved successfully!

Ooh no, something went wrong!