On the period length of the generalized Lagrange algorithm
The author previously obtained (see the preceding review) a number geometric generalization of Lagrange's continued fraction algorithm. This new algorithm yields a fundamental system of units and the class number of any algebraic number field F by means of computing cycles of reduced ideals. In the paper under review it is shown that the cardinality of a cycle of reduced ideals in an ideal class of an order \({\mathfrak O}\) of F is O(R) where R is the regulator of \({\mathfrak O}\), and where the big O-constant depends only on the degree of F over \({\mathbb{Q}}\). A lower bound for this cardinality is also given.
- On the computation of units and class numbers by a generalization of Lagrange's algorithm
- Abschätzung der Periodenlänge einer verallgemeinerten Kettenbruchentwicklung.
- On Lagrange algorithm for reduced algebraic irrationalities
- A Practical Version of the Generalized Lagrange Algorithm
- New algorithm of continued fractions related to real algebraic number fields of degree 5
- Abschätzung der Periodenlänge einer verallgemeinerten Kettenbruchentwicklung.
- scientific article; zbMATH DE number 3918492 (Why is no real title available?)
- scientific article; zbMATH DE number 3749126 (Why is no real title available?)
- scientific article; zbMATH DE number 3099819 (Why is no real title available?)
- On the computation of units and class numbers by a generalization of Lagrange's algorithm
- Caliber of a global field
- On the computation of units and class numbers by a generalization of Lagrange's algorithm
- New generalization of continued fraction. I
- On Lagrange algorithm for reduced algebraic irrationalities
- On reduced Arakelov divisors of real quadratic fields
- On the Computation of Unit Groups and Class Groups of Totally Real Quartic Fields
- Abschätzung der Periodenlänge einer verallgemeinerten Kettenbruchentwicklung.
- On the Infrastructure of the Principal Ideal Class of an Algebraic Number Field of Unit Rank One
- A Practical Version of the Generalized Lagrange Algorithm
- Constructing nonresidues in finite fields and the extended Riemann hypothesis
- Voronoi's algorithm in purely cubic congruence function fields of unit rank 1
- Quadratic extensions of the rational field, the Gauss field or the field of cubic roots of unity of caliber 1
This page was built for publication: On the period length of the generalized Lagrange algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820815)