Reduced ideals from the reduction algorithm

DOI10.1007/S00025-023-02076-1MaRDI QIDQ6140062zbMATH OpenOpenAlexFDO

Authors Peng Tian, Ha Thanh Nguyen Tran

Publication date 19 January 2024

Published in Results in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

LLL reduced basisreduced idealreduction algorithm

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Quadratic extensions (11R11) Algebraic number theory computations (11Y40)

Abstract: The reduction algorithm is used to compute reduced ideals of a number field. However, there are reduced ideals that can never be obtained from this algorithm. In this paper, we will show that these ideals have inverses of larger norms among reduced ones. Especially, we represent a sufficient and necessary condition for reduced ideals of real quadratic fields to be obtained from the reduction algorithm.

Recommendations

• scientific article; zbMATH DE number 4029701
• scientific article; zbMATH DE number 1643950
• On reduced Arakelov divisors of real quadratic fields
• Efficient ideal reduction in quadratic fields
• scientific article; zbMATH DE number 1186973

Cites work

• Computing Arakelov class groups
• scientific article; zbMATH DE number 4200333 (Why is no real title available?)
• scientific article; zbMATH DE number 3739701 (Why is no real title available?)
• scientific article; zbMATH DE number 3765915 (Why is no real title available?)
• scientific article; zbMATH DE number 3522065 (Why is no real title available?)
• On reduced Arakelov divisors of real quadratic fields
• On the Infrastructure of the Principal Ideal Class of an Algebraic Number Field of Unit Rank One

This page was built for publication: Reduced ideals from the reduction algorithm

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