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.

408 <strong>Geometry</strong> of Numbers<br />

Macbeath [674]. An easy proof led Macbeath to the following result: If L = AZ d ,<br />

where A is a DOTU-matrix, then the conjecture holds for the lattice L. Itisthus<br />

of interest to find out whether all d × d-matrices are DOTU-matrices or not. It is<br />

easy to see that each real 2 × 2matrixisDOTU. After some unsuccessful attempts,<br />

Narzulaev [763] established this for d = 3. Narzullaev <strong>and</strong> Ramharter [765] proved<br />

that all non-singular 4 × 4 matrices A, for which the homogeneous minimum (2) of<br />

the lattice L = AZ 4 is sufficiently small, are DOTU-matrices. It is easy to see that<br />

for all d the rational d × d matrices are DOTU <strong>and</strong> Macbeath showed that the set<br />

of DOTU-matrices is open. Hence, the d × dDOTU-matrices form a dense open<br />

set in the space of all non-singular d × d matrices.<br />

Unfortunately, <strong>Gruber</strong> [413] <strong>and</strong> Ahmedov [4] showed for infinitely many,<br />

respectively, all sufficiently large d, the existence of d × d matrices which are not<br />

DOTU. Skubenko [943] gave an example of such a matrix for d = 2880 <strong>and</strong><br />

Hendrik Lenstra [648] communicated an example with d = 64. These examples<br />

make use of algebraic number theory <strong>and</strong>, in particular, of class field theory.<br />

A Related Conjecture<br />

which has attracted some interest is the following; we state it in geometric form:<br />

Conjecture 27.3. For k = 0,...,d <strong>and</strong> any lattice L in Ed , the family of all translates<br />

of the set<br />

�<br />

x : x1,...,xk ≥ 0, |x1 ···xd| ≤ d(L)<br />

2d−k �<br />

by vectors of L covers E d .<br />

This conjecture was proved by Chalk [200] for k = d <strong>and</strong> all d, by Cole [212] for<br />

k = d − 1 <strong>and</strong> all d <strong>and</strong> by Bambah <strong>and</strong> Woods [61] for k = 2 <strong>and</strong> d = 3. All other<br />

cases seem to be open.<br />

27.2 Mordell’s Inverse Problem <strong>and</strong> the Epstein Zeta-Function<br />

A geometric version of the Minkowski linear form theorem is as follows, see<br />

Corollary 22.2: Let L be a lattice in E d with d(L) = 1. Given numbers τ1,...,τd > 0<br />

such that τ1 ···τd ≥ 1, the lattice L contains a point �= o in the box<br />

(1) |x1| ≤τ1,...,|xd| ≤τd.<br />

This led Mordell [753] to consider the problem to choose τ1,...,τd > 0 such that<br />

τ1 ···τd is as large as possible <strong>and</strong> there is no point of L \{o} in the box (1).<br />

Given a lattice L in E d ,theEpstein zeta-function ζ(L, ·) is defined as follows:<br />

ζ(L, s) = �<br />

l∈L\{o}<br />

1 d<br />

for s ><br />

�l�2s 2 .

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

Saved successfully!

Ooh no, something went wrong!