The contact polytope of the Leech lattice (Q603877): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s00454-010-9266-z / rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1985513765 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 0906.1427 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4935168 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Experimental Study of Energy-Minimizing Point Configurations on Spheres / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3622254 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992965 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universally optimal distribution of points on spheres / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4219187 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Voronoi polytopes for polyhedral norms on lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Seven Dimensional Perfect Delaunay Polytopes and Delaunay Simplices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity and algorithms for computing Voronoi cells of lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The contact polytope of the Leech lattice / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4156927 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3998721 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geometry of cuts and metrics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equiangular lines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Permutation group algorithms based on partitions. I: Theory and algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4335298 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A characterization of root lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5785712 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lectures on Polytopes / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S00454-010-9266-Z / rank | |||
Normal rank |
Latest revision as of 22:01, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The contact polytope of the Leech lattice |
scientific article |
Statements
The contact polytope of the Leech lattice (English)
0 references
8 November 2010
0 references
The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper, the authors classify the facets of the contact polytope of Leech lattice up to lattice isometries. There are 1,197,362,269,604,214,277,200 many facets in 232 orbits. The classification is obtained via adjacency decomposition method.
0 references
Leech lattice
0 references
contact polytope
0 references
Conway groups
0 references
Voronoi cell
0 references