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.

31 Covering with <strong>Convex</strong> Bodies 457<br />

x ∈ C + ln. Hence (ln) is a bounded sequence in E d . By cancellation <strong>and</strong> renumbering,<br />

if necessary, we may assume that l1, l2, ··· → l ∈ E d , say. Then l ∈ L by (6).<br />

The inclusion x ∈ C + ln <strong>and</strong> the fact that C is closed yield x ∈ C + l. The proof of<br />

(7) is complete.<br />

Concluding, L is a covering lattice of C, by (7), <strong>and</strong> Propositions (5) <strong>and</strong> (1)<br />

imply that<br />

δ(C, L) =<br />

V (C)<br />

d(L)<br />

V (C)<br />

= lim<br />

n→∞ d(Ln) = ϑL(C). ⊓⊔<br />

Remark. A different proof shows that ϑT (C) is attained for suitable discrete sets T ,<br />

see Hlawka [510] <strong>and</strong> Groemer [399].<br />

The Covering Criterion of Wills<br />

Given a convex body C in E d , when does a lattice provide a covering of C? There<br />

is a small number of pertinent results. We cite the following interesting theorem of<br />

Wills [1026].<br />

Theorem 31.2. Let C be a proper convex body in Ed with V (C) > 1 2 S(C). Then the<br />

integer lattice Zd is a covering lattice of C.<br />

Remark. A generalization of this result which deals with multiple coverings is due<br />

to Bokowski, Hadwiger <strong>and</strong> Wills [138]. For other covering criteria, see [447].<br />

Considering the covering criterion, the following problem arises.<br />

Problem 31.1. Extend the covering criterion to general lattices.<br />

31.2 Star Numbers<br />

Given a lattice covering of a convex body C in E d , its star number is the number of<br />

the translates of C by lattice vectors, including C, which intersect the body C.<br />

In the following we give a lower bound for star numbers due to Erdös <strong>and</strong> Rogers.<br />

An upper bound in the spirit of the lower estimate of Swinnerton-Dyer for neighbours<br />

in packings still seems to be missing. We formulate this as a problem:<br />

Problem 31.2. Find a tight upper bound for the star number of lattice coverings of<br />

(symmetric or general) proper convex bodies which (locally) have minimum density.<br />

Lower Estimate for the Star Number<br />

The precise lower bound for star numbers of lattice coverings of o-symmetric convex<br />

bodies is due to Erdös <strong>and</strong> Rogers [308]:<br />

Theorem 31.3. Let C be a proper, o-symmetric convex body <strong>and</strong> L a covering lattice<br />

of C in E d . Then the star number of the covering {C + l : l ∈ L} is at least 2 d+1 − 1.

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

Saved successfully!

Ooh no, something went wrong!