A computer algorithm for finding new Euclidean number fields

DOI10.5802/JTNB.217MaRDI QIDQ1273177zbMATH OpenOpenAlexFDO

Authors Roland Quême

Publication date 15 March 1999

Published in Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=JTNB_1998__10_1_33_0, https://eudml.org/doc/93711, http://www.emis.de/journals/JTNB/1998-1/jtnb10-1.html

zbMATH Keywords

\(S\)-integersEuclidean algorithmEuclidean number fieldsinhomogeneous minimum

Mathematics Subject Classification ID

Other number fields (11R21) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Review text

The main result of this article is the construction of more than 1200 number fields of degrees \(4\), \(5\) and \(6\) that are Euclidean with respect to the absolute value of the norm. The main idea is classical: divide the fundamental domain of the lattice \({\mathcal O}_K\) into sufficiently small cubes and, for each cube, find an element \(\gamma\in O_K\) such that \(| N(\xi-\gamma)|<1\) for all \(\xi\) in that cube. If there are cubes left after several repeated divisions, stage 2 of the algorithm checks whether multiplication by units transforms a cube into some covered region: these cubes can then be eliminated. The author goes on to discuss applications of his algorithm to rings of \(S\)-integers and finally asks whether the inhomogeneous minima of number fields with fixed signature can be bounded by a constant times the square root of the absolute value of the discriminant; as examples in degree \(3\) and \(4\) due to Swinnerton-Dyer and Davenport show (see the reviewer's survey [\textit{F. Lemmermeyer}, Expo. Math. 13, No. 5, 385-416 (1995; Zbl 0843.11046)]), the answer is negative.

Recommendations

• The Euclidean Algorithm in Cubic Number Fields
• Upper bounds for Euclidean minima of algebraic number fields
• Inhomogeneous minima of mixed signature lattices
• On the Euclidean minimum of some real number fields
• Computation of the Euclidean minimum of algebraic number fields
• Computation of Euclidean minima in totally definite quaternion fields
• Bounds for the Euclidean minima of function fields
• On the norm-Euclideanity of \(\mathbb Q\left(\sqrt{2+\sqrt{2+\sqrt 2}}\right)\) and \(\mathbb Q\left(\sqrt{2+\sqrt 2}\right)\)
• scientific article; zbMATH DE number 4139889
• The Euclidean algorithm in algebraic number fields

Cites work

• Euclidean number fields of large degree
• scientific article; zbMATH DE number 3235414 (Why is no real title available?)
• LINEAR FORMS ASSOCIATED WITH AN ALGEBRAIC NUMBER-FIELD
• On the finite generation of linear groups over Hasse domains.
• The Euclidean algorithm in algebraic number fields
• The Euclidean Algorithm in Cubic Number Fields

Cited in

(11)

• Euclidean minima of totally real number fields: Algorithmic determination
• Use of a Computer Scan to Prove Q (√2 + √2) and Q (√3 + √2) are Euclidean
• Euclid's Algorithm in Cubic Fields with Complex Conjugates
• The Minimal Euclidean Norm of an Algebraic Number Is Effectively Computable
• Computation of Euclidean minima in totally definite quaternion fields
• A sufficient condition of Euclidean rings given by polynomial optimization over a box
• Computation of the Euclidean minimum of algebraic number fields
• Euclidean algorithm in imaginary abelian sextic number fields
• Euclidean fields having a large Lenstra constant
• On the Euclidean minimum of some real number fields
• Exceptional units and Euclidean number fields

This page was built for publication: A computer algorithm for finding new Euclidean number fields

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