An LLL algorithm with symmetries
We give a generalization of the Lenstra–Lenstra–Lovász (LLL) lattice-reduction algorithm that is valid for an arbitrary (split, semisimple) reductive group [Formula: see text]. This can be regarded as “lattice reduction with symmetries.” We make this algorithm explicit for the classical groups [Formula: see text], [Formula: see text], and for the exceptional group [Formula: see text].
Authors
- Beth Romano (ORCID: https://orcid.org/0000-0002-4480-636X)
- Jack A. Thorne (ORCID: https://orcid.org/0000-0002-5900-3260)
Institutions
- King's College London (GB)
- University of Cambridge (GB)
Publication Details
- Journal
- International Journal of Number Theory
- Published
- 2025-02-07
- DOI
- https://doi.org/10.1142/s1793042125500708
- Citations
- 1
- Primary Topic
- Metaheuristic Optimization Algorithms Research
- Type
- article
- Field-Weighted Citation Impact
- 2.48