Bounds for solid angles of lattices of rank three

We find sharp absolute constants C"1 and C"2 with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spanned by these basis vectors lies in the interval [C"1,C"2]. In fact, we show that these absolute bounds hold for a larger class of lattices than just well-rounded, and the upper bound holds for all. We state a technical condition on the lattice that may prevent it from satisfying the absolute lower bound on the solid angle, in which case we derive a lower bound in terms of the ratios of successive minima of the lattice. We use this result to show that among all spherical triangles on the unit sphere in R^N with vertices on the minimal vectors of a lattice, the smallest possible area is achieved by a configuration of minimal vectors of the (normalized) face centered cubic lattice in R^3. Such spherical configurations come up in connection with the kissing number problem.

[1]  N. J. A. Sloane,et al.  Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.

[2]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[3]  Martin Aigner,et al.  The problem of the thirteen spheres , 1998 .

[4]  Thomas C. Hales Sphere packings, I , 1997, Discret. Comput. Geom..

[5]  J. Martinet Perfect Lattices in Euclidean Spaces , 2010 .

[6]  A. L. Spherical Trigonometry , Nature.

[7]  Amir K. Khandani,et al.  On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis , 1998, IEEE Trans. Inf. Theory.

[8]  W. Hsiang Least Action Principle of Crystal Formation of Dense Packing Type and Kepler's Conjecture , 2002 .

[9]  Michael E. Pohst,et al.  On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications , 1981, SIGS.

[10]  N. J. A. Sloane,et al.  New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions , 1979, J. Comb. Theory, Ser. A.

[11]  Sanjeeb Dash,et al.  On Nearly Orthogonal Lattice Bases and Random Lattices , 2007, SIAM J. Discret. Math..

[12]  Richard Baraniuk,et al.  On Nearly Orthogonal Lattice Bases , 2005 .

[13]  F. Thorne,et al.  Geometry of Numbers , 2017, Algebraic Number Theory.

[14]  C. Bachoc,et al.  New upper bounds for kissing numbers from semidefinite programming , 2006, math/0608426.

[15]  B. L. Waerden,et al.  Das Problem der dreizehn Kugeln , 1952 .

[16]  O. Musin The kissing number in four dimensions , 2003, math/0309430.