arXiv · 1210.0571
Well-rounded sublattices and coincidence site lattices
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Peter Zeiner. 2012-10-01. Well-rounded sublattices and coincidence site lattices. https://arxiv.org/abs/1210.0571
Cite the original work for its findings. Save a collection to share your selection of sources.