44 research outputs found

    Norm-Euclidean Galois fields

    Full text link
    Let K be a Galois number field of prime degree \ell. Heilbronn showed that for a given \ell there are only finitely many such fields that are norm-Euclidean. In the case of =2\ell=2 all such norm-Euclidean fields have been identified, but for 2\ell\neq 2, little else is known. We give the first upper bounds on the discriminants of such fields when >2\ell>2. Our methods lead to a simple algorithm which allows one to generate a list of candidate norm-Euclidean fields up to a given discriminant, and we provide some computational results

    Norm-Euclidean Galois fields and the Generalized Riemann Hypothesis

    Get PDF
    Assuming the Generalized Riemann Hypothesis (GRH), we show that the norm-Euclidean Galois cubic fields are exactly those with discriminant Δ=72,92,132,192,312,372,432,612,672,1032,1092,1272,1572\Delta=7^2,9^2,13^2,19^2,31^2,37^2,43^2,61^2,67^2,103^2,109^2,127^2,157^2. A large part of the proof is in establishing the following more general result: Let KK be a Galois number field of odd prime degree \ell and conductor ff. Assume the GRH for ζK(s)\zeta_K(s). If 38(1)2(logf)6loglogf<f38(\ell-1)^2(\log f)^6\log\log f<f, then KK is not norm-Euclidean

    An improved error term for counting D4D_4-quartic fields

    Full text link
    We prove that the number of quartic fields KK with discriminant ΔKX|\Delta_K|\leq X whose Galois closure is D4D_4 equals CX+O(X3/5+ϵ)CX+O(X^{3/5+\epsilon}), improving the error term in a well-known result of Cohen, Diaz y Diaz, and Olivier.Comment: 11 pages, 1 figur

    Computation of the least primitive root

    Full text link
    Let g(p)g(p) denote the least primitive root modulo pp, and h(p)h(p) the least primitive root modulo p2p^2. We computed g(p)g(p) and h(p)h(p) for all primes p1016p\le 10^{16}. Here we present the results of that computation and prove three theorems as a consequence. In particular, we show that g(p)<p5/8g(p)<p^{5/8} for all primes p>3p>3 and that h(p)<p2/3h(p)<p^{2/3} for all primes pp

    Counting quintic fields with genus number one

    Full text link
    We prove several results concerning genus numbers of quintic fields: we compute the proportion of quintic fields with genus number one; we prove that a positive proportion of quintic fields have arbitrarily large genus number; and we compute the average genus number of quintic fields. All of these results also hold when restricted to S5S_5-quintic fields only.Comment: 7 page
    corecore