Professional Documents
Culture Documents
L-types
Mathieu Dutour Sikiric
Institute Rudjer Boskovic
Achill Schuermann
Magdeburg University
Frank Vallentin
CWI Amsterdam
November 24, 2011
Gram matrix and lattices
Denote S
n
>0
the cone of real symmetric positive denite n n
matrices and S
n
0
the positive semidenite ones.
Lattice L spanned by v
1
, . . . , v
n
corresponds to
G
v
= (v
i
, v
j
)
1i ,j n
S
n
>0
.
G
v
depends only on the isometry class of L.
Given M S
n
>0
, one can nd vectors v
1
, . . . , v
n
such that
M = G
v
.
Empty sphere and Delaunay polytopes
A sphere S(c, r ) of radius r and center c in an n-dimensional
lattice L is said to be an empty sphere if:
(i) |v c| r for all v L,
(ii) the set S(c, r ) L contains n + 1 anely independent points.
A Delaunay polytope P in a lattice L is a polytope, whose
vertex-set is L S(c, r ).
c
r
Equalities and inequalities
Take M = G
v
with v = (v
1
, . . . , v
n
) a basis of lattice L.
If V = (w
1
, . . . , w
N
) with w
i
Z
n
are the vertices of a
Delaunay polytope of empty sphere S(c, r ) then:
[[w
i
c[[ = r i.e. w
T
i
Mw
i
2w
T
i
Mc + c
T
Mc = r
2
n
i =0
i
v
i
with 1 =
n
i =0
i
, then one has
[[w c[[ r w
T
Mw
n
i =0
i
v
T
i
Mv
i
0
III. L-type
domain
L-type domains
The group GL
n
(Z) acts on S
n
>0
by arithmetic equivalence and
preserve the primitive L-type domains.
We consider covering of R
n
by n-dimensional balls of the
same radius, whose center belong to a lattice L.
n
det(L)
1
with (L) being the largest radius of Delaunay polytopes and
n
the volume of the unit ball B
n
.
n
.
Lattice packing-covering
L is a n-dimensional lattice.
n
1
2
4 H
4
(Horvath lattice)
3 A
3
5 H
5
(Horvath lattice)
J. Horvath, PhD thesis: Several problems of n-dimensional
geometry, Steklov Inst. Math., 1986.
Optimization problem
We want to nd the best covering, packing-covering.
4 v
1
, v
1
v
2
, v
2
. . . v
n
, v
n
v
1
, v
1
v
1
, v
1
v
1
, v
2
. . . v
1
, v
n
v
2
, v
2
v
2
, v
1
v
2
, v
2
. . . v
2
, v
n
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
v
n
, v
n
v
n
, v
1
v
n
, v
2
. . . v
n
, v
n
S
n+1
0
It is a semidenite condition.
B.N. Delone, N.P. Dolbilin, S.S. Ryskov and M.I. Stogrin, A
new construction of the theory of lattice coverings of an
n-dimensional space by congruent balls, Izv. Akad. Nauk
SSSR Ser. Mat. 34 (1970) 289298.
Convex programming problems
geometrical programming,
approximation in l
p
-norms,
the Delaunay D
i
have radius at most 1 (semidenite
condition),
m [[v
j
[[
2
= v
t
j
Mv
j
for all i (linear constraint)
maximize m.
A priori no unicity.
V. L-types
of
S
n
>0
-spaces
S
n
>0
-spaces
A S
n
>0
-space is a vector space oT of S
n
, which intersect S
n
>0
.
Motivations:
If M oT S
n
>0
, then the rigidity degree of M is the
dimension of the smallest L-type containing M, it is computed
using the Delaunay decomposition of M.
Otherwise, rerun.
Testing equivalence of (oT, L)-type
i
e
i
If F is a facet of D
i
and D
,D
i
(M) 0. This form a nite
set of dening inequalities of the (oT, L)-type.
1
(M) = =
r
f
D
j (r )
,D
r
(M) for
some
i
> 0 and some Delaunay D
i
adjacent to D
j (i )
on a
facet F
i
.
Two triangulations of Z
2
correpond in the lifting to:
d
i
and d
j
share a facet
the inequality f
d
i
,d
j
(M) = f (M) for > 0
Iterate
Given a subgroup G of GL
n
(Z), dene
oT(G) =
X S
n
such that gX
t
g = X for all g G
Given a S
n
>0
-space oT, dene
Aut(oT) =
g GL
n
(Z) such that
gX
t
g = X for all X oT
Dimension 6:
6
in the vicinity
of E
6
.
Dimension 7:
7
in the vicinity of E
7
.
Dimension 8:
Conjecture (Zong) E
8
is the best lattice packing-covering in
dimension 8.
C. Zong, From deep holes to free planes, Bull. Amer. Math.
Soc. (N.S.) 39-4 (2002) 533555.
Extension of Coxeter lattices
n
.
:
c
h
L
v
n+1
n+1
v +L
) =
A A
t
c
cA
The symmetries of L
I
n
0
2c 1
2
1.209199 14 L
c
14
8.825210
3 A
3
1.463505 15 L
c
15
11.004951
4 A
4
1.765529 16 A
16
15.310927
5 A
5
2.124286 17 A
9
17
12.357468
6 L
c
6
2.464801 18 A
18
21.840949
7 L
c
7
2.900024 19 A
10
19
21.229200
8 L
c
8
3.142202 20 A
7
20
20.366828
9 L
c
9
4.268575 21 A
11
21
27.773140
10 L
c
10
5.154463 22
22
27.8839
11 L
c
11
5.505591 23
23
15.3218
12 L
c
12
7.465518 24 Leech 7.903536
THANK
YOU