arXiv Analytics

Sign in

arXiv:1210.0571 [math.MG]AbstractReferencesReviewsResources

Well-rounded sublattices and coincidence site lattices

Peter Zeiner

Published 2012-10-01Version 1

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.

Related articles: Most relevant | Search more
arXiv:math/0605525 [math.MG] (Published 2006-05-18)
Symmetries of Coincidence Site Lattices of Cubic Lattices
arXiv:1212.4528 [math.MG] (Published 2012-12-18)
Multiplicativity in the theory of coincidence site lattices
arXiv:1011.1001 [math.MG] (Published 2010-11-03)
Colourings of lattices and coincidence site lattices