Geometric enumeration problems for lattices and embedded $\mathbb{Z}$-modules

Abstract

In this review, we count and classify certain sublattices of a given lattice, as motivated by crystallography. We use methods from algebra and algebraic number theory to find and enumerate the sublattices according to their index. In addition, we use tools from analytic number theory to determine the asymptotic behaviour of the corresponding counting functions. Our main focus lies on similar sublattices and coincidence site lattices, the latter playing an important role in crystallography. As many results are algebraic in nature, we also generalise them to $\mathbb{Z}$-modules embedded in ${\mathbb{R}}^d$.

arXiv comment92 pages, 2 figures; review article

References in corpus (11)

• Planar coincidences for N-fold symmetry
• Solution of the coincidence problem in dimensions $d\le 4$
• Bravais colourings of planar modules with N-fold symmetry
• Coincidence rotations of the root lattice $A_4$
• SCD Patterns Have Singular Diffraction
• A Note on Coincidence Isometries of Modules in Euclidean Space
• Coincidences in 4 dimensions
• Similarity and Coincidence Isometries for Modules
• Multiplicativity in the theory of coincidence site lattices
• The coincidence problem for shifted lattices and crystallographic point packings
• Coincidence isometries of a shifted square lattice