Geometric Enumeration Problems for Lattices and Embedded ℤ-Modules

DOI10.1017/9781139033862.005zbMATH Open1440.11116arXiv1709.07317OpenAlexW2766539761MaRDI QIDQ5226743FDOQ5226743

Michael Baake, Peter Zeiner

Publication date: 1 August 2019

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 $mathbbZ$-modules embedded in $mathbb{R}^d$.

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

zbMATH Keywords

crystallographycoincidence site latticesembedded $\mathbb{Z}$-modules

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06)

Cited In (5)

• Coincidence rotations of the root lattice \(A_4\)
• Structure of coincidence isometry groups
• Similar sublattices and submodules
• Spectral and arithmetic structures in aperiodic order
• Geometric configurations in the ring of integers modulo \(p^{\ell}\)

This page was built for publication: Geometric Enumeration Problems for Lattices and Embedded ℤ-Modules

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