arXiv · 2301.10359
Tempered Perfect Lattices in the Binary Case
Abstract
A new algorithm for computing Hecke operators for SL(n,Z) was introduced by MacPherson, McConnell in 2020. The algorithm uses tempered perfect lattices, which are certain pairs of lattices together with a quadratic form. These generalize the perfect lattices of Voronoi. The present paper is the first step in characterizing tempered perfect lattices. We obtain a complete classification in the plane, where the Hecke operators are for SL(2,Z) and its arithmetic subgroups. The results depend on the class field theory of orders in imaginary quadratic number fields.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Erik Bahnson, Mark McConnell, Kyrie McIntosh. 2023-01-25. Tempered Perfect Lattices in the Binary Case. https://doi.org/10.1016/j.jnt.2024.02.009
Cite the original work for its findings. Save a collection to share your selection of sources.