Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
A simple and relatively efficient triangulation of the n-cube
Discrete & Computational Geometry
A lower bound for the simplexity of the n-cube via hyperbolic volumes
European Journal of Combinatorics - Special issue on combinatorics of polytopes
The six-dimensional Delaunay polytopes
European Journal of Combinatorics - Special issue on arithmétique et combinatoire
Geometry of Cuts and Metrics
Hi-index | 0.00 |
In this short note we give a construction of an infinite series of Delone simplices whose relative volume grows super-exponentially with their dimension. This dramatically improves the previous best lower bound, which was linear.