The Euclidean algorithm in algebraic number fields

zbMath0843.11046MaRDI QIDQ1908009

Franz Lemmermeyer

Publication date: 13 August 1996

Published in: Expositiones Mathematicae (Search for Journal in Brave)

zbMATH Keywords

surveytablesbibliographyclass numberalgebraic number fieldsunsolved problemsEuclidean algorithmEuclidean minima\(k\)-stage algorithm

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to number theory (11-02) Algebraic numbers; rings of algebraic integers (11R04) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Minima of forms (11H50)

Related Items (33)

On the Euclidean minimum of some real number fields ⋮ Inhomogeneous minima of mixed signature lattices ⋮ A note on Euclidean cyclic cubic fields ⋮ Remarks on Euclidean minima ⋮ On the S-Euclidean minimum of an ideal class ⋮ Upper bounds for Euclidean minima of algebraic number fields ⋮ Unnamed Item ⋮ Upper bounds for the Euclidean minima of abelian fields of odd prime power conductor ⋮ Bounds for the Euclidean minima of function fields ⋮ Statistics of genus numbers of cubic fields ⋮ Euclidean algorithm in Galois quartic fields ⋮ On the finiteness of $\mathfrak{P}$-adic continued fractions for number fields ⋮ The Euclidean algorithm in quintic and septic cyclic fields ⋮ Growth results and Euclidean ideals ⋮ Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers ⋮ On a Waring’s problem for integral quadratic and Hermitian forms ⋮ Computation of the Euclidean minimum of algebraic number fields ⋮ A generalization of the LLL-algorithm over Euclidean rings or orders ⋮ Continued fractionsin $2$-stage Euclidean quadratic fields ⋮ Transfinitely valued Euclidean domains have arbitrary indecomposable order type ⋮ On the norm-Euclideanity of \(\mathbb Q\left(\sqrt{2+\sqrt{2+\sqrt 2}}\right)\) and \(\mathbb Q\left(\sqrt{2+\sqrt 2}\right)\) ⋮ NTRU over rings beyond \(\mathbb{Z}\) ⋮ Norm-Euclidean Galois fields and the generalized Riemann hypothesis ⋮ New number-theoretic cryptographic primitives ⋮ The eleventh power residue symbol ⋮ Upper bounds for the Euclidean minima of abelian fields ⋮ Two efficient algorithms for the computation of ideal sums in quadratic orders ⋮ Non-Galois cubic fields which are Euclidean but not norm-Euclidean ⋮ Badly approximable numbers over imaginary quadratic fields ⋮ Some generalized Euclidean and 2-stage Euclidean number fields that are not norm-Euclidean ⋮ A computer algorithm for finding new Euclidean number fields ⋮ Euclidean systems ⋮ Euclidean minima of totally real number fields: Algorithmic determination

This page was built for publication: The Euclidean algorithm in algebraic number fields