Skip to content
DraconiticResearch
Search Sources API
184,937 studies31 sourcesUpdated 10 min ago
PreprintCC BY 4.0arXiv

Adelic reduction of module lattices

Abstract

We give a strict generalization of the LLL algorithm over number fields, based on the reduction theory of GL(n) over the adele ring of a number field. Our algorithm is free of heuristics, with rigorous bounds on output quality and complexity. As a consequence, we obtain a hierarchy of reductions from module-(H)SVP to ideal-HSVP, an example of which has runtime and approximation factors subexponential in the field degree. More importantly, we uncover a close connection between structured lattice reduction and a Diophantine approximation over number fields.

Related

  1. Concave transforms and volumes of adelic line bundles
    Yuxing Ye
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. Construction of vector-valued adelic automorphic forms
    Oliver Stein
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  3. An adelic approach to the Kudla-Millson lifts over totally real number fields
    Yingkun Li, Mingkuan Zhang, Riccardo Zuffetti
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. Effective Joint Equidistribution of Subspaces of Bounded Height in Rigid Adelic Spaces
    Ruida Di
    arXivPreprintarXiv licenceFull textAlgebra & number theoryDynamical systemsarXiv
  5. Covering Projective Height Balls by Subspaces in Rigid Adelic Spaces
    Ruida Di, Runjie Hu
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
BibTeX
@misc{bambury2026adelic,
  title = {{Adelic reduction of module lattices}},
  author = {Henry Bambury and Seungki Kim and Changmin Lee and Phong Q. Nguyen},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.32936},
  eprint = {2609.32936},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.32936},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Adelic reduction of module lattices
AU  - Henry Bambury
AU  - Seungki Kim
AU  - Changmin Lee
AU  - Phong Q. Nguyen
PY  - 2026
DA  - 2026/09/26
PB  - arXiv
DO  - 10.48550/arxiv.2609.32936
UR  - https://arxiv.org/abs/2609.32936
AB  - We give a strict generalization of the LLL algorithm over number fields, based on the reduction theory of GL(n) over the adele ring of a number field. Our algorithm is free of heuristics, with rigorous bounds on output quality and complexity. As a consequence, we obtain a hierarchy of reductions from module-(H)SVP to ideal-HSVP, an example of which has runtime and approximation factors subexponential in the field degree. More importantly, we uncover a close connection between structured lattice reduction and a Diophantine approximation over number fields.
ER  -