Geometric enumeration problems for lattices and embedded \mathbb{Z}-modules
From MaRDI portal
Publication:5226743
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 -modules embedded in .
Recommendations
- Classification of the sublattices of a lattice
- Similar sublattices of planar lattices
- Alternative formulae for the number of sublattices
- Sublattice enumeration. IV. Equivalence classes of plane sublattices by parent Patterson symmetry and colour lattice group type
- Well-rounded sublattices of planar lattices
Cited in
(6)- Similar sublattices and submodules
- Spectral and arithmetic structures in aperiodic order
- Geometric configurations in the ring of integers modulo \(p^{\ell}\)
- The enumeration and symmetry-significant properties of derivative lattices
- Structure of coincidence isometry groups
- Coincidence rotations of the root lattice \(A_4\)
This page was built for publication: Geometric enumeration problems for lattices and embedded $\mathbb{Z}$-modules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226743)