The Euclidean algorithm in quintic and septic cyclic fields

@article{Lezowski2017TheEA,
  title={The Euclidean algorithm in quintic and septic cyclic fields},
  author={Pierre Lezowski and Kevin J. McGown},
  journal={Math. Comput.},
  year={2017},
  volume={86},
  pages={2535-2549}
}
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… Expand
4 Citations
N T ] 3 0 O ct 2 01 9 AN INVESTIGATION INTO SEVERAL EXPLICIT BURGESS
  • 2019
  • Highly Influenced
An Investigation Into Several Explicit Versions of Burgess' Bound
  • 2
  • Highly Influenced
  • PDF
Explicit bounds for small prime nonresidues
  • 1
  • PDF

References

SHOWING 1-10 OF 21 REFERENCES
Norm-Euclidean Galois fields and the Generalized Riemann Hypothesis
  • 3
  • PDF
On Euclid's Algorithm in some Cyclic Cubic Fields
  • 13
On the second smallest prime non-residue
  • 4
  • PDF
Euclidean minima of totally real number fields: Algorithmic determination
  • J. Cerri
  • Computer Science, Mathematics
  • Math. Comput.
  • 2007
  • 16
  • Highly Influential
  • PDF
Explicit bounds for primality testing and related problems
  • 211
  • PDF
Computation of the Euclidean minimum of algebraic number fields
  • 7
  • PDF
NORM-EUCLIDEAN CYCLIC FIELDS OF PRIME DEGREE
  • 12
  • PDF
The Burgess inequality and the least kth power non-residue
  • 18
  • PDF
The least k-th power non-residue
  • 10
ON THE MAXIMUM NUMBER OF CONSECUTIVE INTEGERS ON WHICH A CHARACTER IS CONSTANT
  • 4
  • PDF
...
1
2
3
...