Skip to Main content Skip to Navigation
Theses

Geometric distance graphs, lattices and polytopes

Abstract : A distance graph G(X;D) is a graph whose set of vertices is the set of points X of a metric space (X; d), and whose edges connect the pairs fx; yg such that d(x; y) 2 D. In this thesis, we consider two problems that may be interpreted in terms of distance graphs in Rn. First, we study the famous sphere packing problem, in relation with thedistance graph G(Rn; (0; 2r)) for a given sphere radius r. Recently, Venkatesh improved the best known lower bound for lattice sphere packings by a factor log log n for infinitely many dimensions n. We prove an effective version of this result, in the sense that we exhibit, for the same set of dimensions, finite families of lattices containing a lattice reaching this bound. Our construction uses codes over cyclotomic fields, lifted to lattices via Construction A. We also prove a similar result for families of symplectic lattices. Second, we consider the unit distance graph G associated with a norm k _ k. The number m1 (Rn; k _ k) is defined as the supremum of the densities achieved by independent sets in G. If the unit ball corresponding with k _ k tiles Rn by translation, then it is easy to see that m1 (Rn; k _ k) > 1 2n . C. Bachoc and S. Robins conjectured that the equality always holds. We show that this conjecture is true for n = 2 and for several Voronoï cells of lattices in higher dimensions, by solving packing problems in discrete graphs.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-01677284
Contributor : Abes Star :  Contact
Submitted on : Monday, January 8, 2018 - 11:13:06 AM
Last modification on : Wednesday, January 31, 2018 - 5:23:03 AM
Document(s) archivé(s) le : Friday, May 4, 2018 - 12:47:48 AM

File

MOUSTROU_PHILIPPE_2017.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-01677284, version 1

Collections

Citation

Philippe Moustrou. Geometric distance graphs, lattices and polytopes. General Mathematics [math.GM]. Université de Bordeaux, 2017. English. ⟨NNT : 2017BORD0802⟩. ⟨tel-01677284⟩

Share

Metrics

Record views

856

Files downloads

325