Well-rounded sublattices and coincidence site lattices
classification
🧮 math.MG
cond-mat.mtrl-sci
keywords
well-roundedlatticessublatticescoincidencelatticesiteambientasymptotic
read the original abstract
A lattice is called well-rounded, if its lattice vectors of minimal length span the ambient space. We show that there are interesting connections between the existence of well-rounded sublattices and coincidence site lattices (CSLs). Furthermore, we count the number of well-rounded sublattices for several planar lattices and give their asymptotic behaviour.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.