On well-rounded sublattices of the hexagonal lattice

From MaRDI portal
Publication:712254

DOI10.1016/J.DISC.2010.07.014zbMATH Open1228.11093arXiv1007.2667OpenAlexW1965797741MaRDI QIDQ712254FDOQ712254


Authors: D. Kharzeev Edit this on Wikidata


Publication date: 28 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameterization to study the number, the greatest minimal norm, and the highest signal-to-noise ratio of well-rounded sublattices of the hexagonal lattice of a fixed index. This investigation parallels earlier work by Bernstein, Sloane, and Wright where similar questions were addressed on the space of all sublattices of the hexagonal lattice. Our restriction is motivated by the importance of well-rounded lattices for discrete optimization problems. Finally, we also discuss the existence of a natural combinatorial structure on the set of similarity classes of well-rounded sublattices of the hexagonal lattice, induced by the action of a certain matrix monoid.


Full work available at URL: https://arxiv.org/abs/1007.2667




Recommendations




Cites Work


Cited In (9)





This page was built for publication: On well-rounded sublattices of the hexagonal lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q712254)