Abstract
We focus on two important classes of lattices, the well-rounded and the cyclic. We show that every well-rounded lattice in the plane is similar to a cyclic lattice, and use this cyclic parameterization to count planar well-rounded similarity classes defined over a fixed number field with respect to height. We then investigate cyclic properties of the irreducible root lattices in arbitrary dimensions, in particular classifying those that are simple cyclic, i.e. generated by rotation shifts of a single vector. Finally, we classify cyclic, simple cyclic and well-rounded cyclic lattices coming from rings of integers of Galois algebraic number fields.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
