English

The Euclidean algorithm in quintic and septic cyclic fields

Number Theory 2016-07-05 v2

Abstract

Conditionally on the Generalized Riemann Hypothesis (GRH), we prove the following results: (1) a cyclic number field of degree 55 is norm-Euclidean if and only if Δ=114,314,414\Delta=11^4,31^4,41^4; (2) a cyclic number field of degree 77 is norm-Euclidean if and only if Δ=296,436\Delta=29^6,43^6; (3) there are no norm-Euclidean cyclic number fields of degrees 1919, 3131, 3737, 4343, 4747, 5959, 6767, 7171, 7373, 7979, 9797. 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 f157f\leq 157 except possibly when f(21014,1050)f\in(2\cdot 10^{14}, 10^{50}).

Keywords

Cite

@article{arxiv.1601.03433,
  title  = {The Euclidean algorithm in quintic and septic cyclic fields},
  author = {Pierre Lezowski and Kevin J. McGown},
  journal= {arXiv preprint arXiv:1601.03433},
  year   = {2016}
}
R2 v1 2026-06-22T12:29:05.694Z