Add to ORKG© The Author(s) 2010. This article is published with open access at Springerlink.com Abstract The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we classify the facets of the contact polytope of the Leech lattice up to symmetry. There are 1,197,362,269,604,214,277,200 many facets in 232 orbits
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
The results of [9] are generalized and simplified for code lattices. As an example, the code lattice...
AbstractIn this paper a rank 12 even lattice C is constructed which is type 3 (if v ϵ C then (v, v) ...
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we class...
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we class...
This paper catalogues and describes the properties of the Leech lattice and gives a basic introducti...
AbstractWe give a new, elementary, description of the Leech lattice in terms of octonions, thereby p...
AbstractWe give an algorithm that constructs the Hasse diagram of the face lattice of a convex polyt...
AbstractWe study a second example of the phenomenon studied in the article “The complex Lorentzian L...
In this paper we study enumeration problems for polytopes arising from combinatorial optimization pr...
AbstractLet L be a lattice of dimension n≤24 such that the minimal vectors of L form a 6-design and ...
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simpl...
Let L be a lattice of dimension n ≤ 24 such that the minimal vectors of L form a 6-design and genera...
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In ...
The last 15 years have seen a significant progress in the development of general purpose algorithms ...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
The results of [9] are generalized and simplified for code lattices. As an example, the code lattice...
AbstractIn this paper a rank 12 even lattice C is constructed which is type 3 (if v ϵ C then (v, v) ...
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we class...
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we class...
This paper catalogues and describes the properties of the Leech lattice and gives a basic introducti...
AbstractWe give a new, elementary, description of the Leech lattice in terms of octonions, thereby p...
AbstractWe give an algorithm that constructs the Hasse diagram of the face lattice of a convex polyt...
AbstractWe study a second example of the phenomenon studied in the article “The complex Lorentzian L...
In this paper we study enumeration problems for polytopes arising from combinatorial optimization pr...
AbstractLet L be a lattice of dimension n≤24 such that the minimal vectors of L form a 6-design and ...
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simpl...
Let L be a lattice of dimension n ≤ 24 such that the minimal vectors of L form a 6-design and genera...
Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In ...
The last 15 years have seen a significant progress in the development of general purpose algorithms ...
International audienceA lattice (d, k)-polytope is the convex hull of a set of points in dimension d...
The results of [9] are generalized and simplified for code lattices. As an example, the code lattice...
AbstractIn this paper a rank 12 even lattice C is constructed which is type 3 (if v ϵ C then (v, v) ...