Two-dimensional lattices with few distances

MaRDI QIDQ874766zbMATH OpenFDO

Authors Pieter Moree, Robert Osburn

Publication date 10 April 2007

Published in L'Enseignement Mathématique. 2e Série (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0604163

zbMATH Keywords

distancehexagonal latticeTwo-dimensional latticeErdös number

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattices and convex bodies (number-theoretic aspects) (11H06)

Abstract: We prove that of all two-dimensional lattices of covolume 1 the hexagonal lattice has asymptotically the fewest distances. An analogous result for dimensions 3 to 8 was proved in 1991 by Conway and Sloane. Moreover, we give a survey of some related literature, in particular progress on a conjecture from 1995 due to Schmutz Schaller.

Recommendations

• Lattices with few distances
• The multiplicity of the two smallest distances among points
• Lattices modulo \(N\) with long shortest distances
• Distribution of Hermite's constant and the shortest vector in lattices of dimension two
• Lattice Configurations Determining Few Distances

Cited in

(10)

• The lengths of Hermitian self-dual extended duadic codes
• Principal forms X^2+nY^2 representing many integers
• scientific article; zbMATH DE number 5270848 (Why is no real title available?)
• Some results related to finiteness properties of groups for families of subgroups
• 6. Fibonacci lattices have minimal dispersion on the two-dimensional torus
• Lattices with few distances
• Densities of integer sets represented by quadratic forms
• Lattices modulo \(N\) with long shortest distances
• Finding orientations of supersingular elliptic curves and quaternion orders
• Lattice Configurations Determining Few Distances

This page was built for publication: Two-dimensional lattices with few distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q874766)