On well-rounded sublattices of the hexagonal lattice (Q712254)

The authors produce an explicit parametrization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. They use this parametrization 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. Finally, the authors 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.