On the computation of units and class numbers by a generalization of Lagrange's algorithm (Q1820814): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q194715 |
Changed an Item |
||
Property / author | |||
Property / author: Johannes A. Buchmann / rank | |||
Normal rank |
Revision as of 17:58, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the computation of units and class numbers by a generalization of Lagrange's algorithm |
scientific article |
Statements
On the computation of units and class numbers by a generalization of Lagrange's algorithm (English)
0 references
1987
0 references
The author describes an algorithm which allows one to compute a fundamental system of units, a cycle of reduced ideals and the class number of any order \({\mathfrak O}\) of an arbitrary algebraic number field F. His algorithm is a number geometric generalization of Lagrange's continued fraction algorithm and leads to a fundamental system of units of F in \(O(RD^{\epsilon})\) binary operations, for any \(\epsilon >0\); here R is the regulator of F, D is the absolute value of the discriminant of F, and the big O-constant depends only on the degree n of F over \({\mathbb{Q}}\). Examples involving 20 totally real quartic fields are given.
0 references
class number of order
0 references
algorithm
0 references
fundamental system of units
0 references
cycle of reduced ideals
0 references
Lagrange's continued fraction algorithm
0 references
totally real quartic fields
0 references