The Euclidean algorithm in quintic and septic cyclic fields

DOI10.1090/MCOM/3169MaRDI QIDQ2981792zbMATH OpenOpenAlexFDO

Authors Pierre Lezowski, Kevin J. McGown

Publication date 10 May 2017

Published in Mathematics of Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Estimates on character sums (11L40) Algebraic numbers; rings of algebraic integers (11R04) Cubic and quartic extensions (11R16) Galois theory (11R32) Totally real fields (11R80) Algebraic number theory computations (11Y40)

Abstract: Conditionally on the Generalized Riemann Hypothesis (GRH), we prove the following results: (1) a cyclic number field of degree $5$ is norm-Euclidean if and only if $Delta=11^4,31^4,41^4$; (2) a cyclic number field of degree $7$ is norm-Euclidean if and only if $Delta=29^6,43^6$; (3) there are no norm-Euclidean cyclic number fields of degrees $19$, $31$, $37$, $43$, $47$, $59$, $67$, $71$, $73$, $79$, $97$. Our proofs contain a large computational component, including the calculation of the Euclidean minimum in some cases; the correctness of these calculations does not depend upon the GRH. Finally, we improve on what is known unconditionally in the cubic case by showing that any norm-Euclidean cyclic cubic field must have conductor $fleq157$ except possibly when $fin(2cdot10^{14},10^{50})$.

Recommendations

• On Euclid's Algorithm in Cyclic Fields
• The Euclidean algorithm in algebraic number fields
• On Euclid's Algorithm in some Cyclic Cubic Fields
• scientific article; zbMATH DE number 1504691
• The Euclidean algorithm for number fields and primitive roots
• The Euclidean Algorithm in Cubic Number Fields
• Euclid's Algorithm in real Quadratic Fields
• Euclid’s algorithm and the Lanczos method over finite fields
• scientific article; zbMATH DE number 716515
• On the Non-Existence of the Euclidean Algorithm in Certain Quadratic Number Fields

Cites work

• Calculation of the Gamma Function by Stirling's Formula
• Computation of the Euclidean minimum of algebraic number fields
• Euclid's Algorithm in real Quadratic Fields
• Euclidean minima of totally real number fields: Algorithmic determination
• Explicit Bounds for Primality Testing and Related Problems
• scientific article; zbMATH DE number 3055518 (Why is no real title available?)
• Norm-Euclidean cyclic fields of prime degree
• Norm-Euclidean Galois fields and the generalized Riemann hypothesis
• On Euclid's Algorithm in Cyclic Fields
• ON EUCLID'S ALGORITHM IN SOME CUBIC FIELDS WITH SIGNATURE ONE
• On Euclid's Algorithm in some Cyclic Cubic Fields
• On Euclid's Algorithm in Some Quartic and Quintic Fields
• On the Euclidean Nature of Four Cyclic Cubic Fields
• On the maximum number of consecutive integers on which a character is constant
• On the second smallest prime non-residue
• The Burgess inequality and the least kth power non-residue
• The Euclidean algorithm in algebraic number fields
• The inhomogeneous minima of binary quadratic forms. I
• The least \(k\)-th power non-residue

Cited in

(10)

• An investigation into explicit versions of Burgess' bound
• Explicit bounds for small prime nonresidues
• Euclidean algorithm in Galois quartic fields
• Non-norm-Euclidean fields in basic \(Z_{l}\)-extensions
• Norm-Euclidean cyclic fields of prime degree
• On the Euclidean Nature of Four Cyclic Cubic Fields
• A note on Euclidean cyclic cubic fields
• The least quadratic non-residue
• Norm-Euclidean Galois fields and the generalized Riemann hypothesis
• On finiteness of the numbers of Euclidean fields in some classes of number fields

This page was built for publication: The Euclidean algorithm in quintic and septic cyclic fields

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