NORM-EUCLIDEAN CYCLIC FIELDS OF PRIME DEGREE

DOI10.1142/S1793042112500133zbMath1290.11147arXiv1011.4501MaRDI QIDQ3116598

Kevin J. McGown

Publication date: 24 February 2012

Published in: International Journal of Number Theory (Search for Journal in Brave)

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

zbMATH Keywords

character sumscubic fieldscyclic fieldsnorm-Euclidean

Mathematics Subject Classification ID

Galois theory (11R32) Algebraic number theory computations (11Y40) Cubic and quartic extensions (11R16) Estimates on character sums (11L40) Totally real fields (11R80)

Related Items

Non-norm-Euclidean fields in basic \(Z_{l}\)-extensions, The least quadratic non-residue, The Burgess inequality and the least kth power non-residue, An explicit upper bound for \(L(1,\chi)\) when \(\chi\) is quadratic, On the second smallest prime non-residue, 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, Quadratic nonresidues below the Burgess bound, The Euclidean algorithm in quintic and septic cyclic fields, Norm-Euclidean Galois fields and the generalized Riemann hypothesis, On Grosswald’s conjecture on primitive roots, An investigation into explicit versions of Burgess' bound, Explicit bounds for small prime nonresidues

Cites Work

• Unnamed Item
• David Hilbert: The theory of algebraic number fields. Jahresber. Deutsche Math. Ver. 4 (1897), 175--546
• Euclidean minima of totally real number fields: Algorithmic determination
• On Burgess' Bound for Primitive Roots Modulo Primes and an Application to Γ(p)
• Quadratic class numbers and character sums
• On Euclid's Algorithm in Cyclic Fields
• On a problem of Dobrowolski and Williams and the Pólya-Vinogradov inequality