Table of Contents
Fetching ...

Polynomial densities and Heilbronn's criterion

Alexis Hibbler, Kevin J. McGown, Enrique Treviño

TL;DR

This work analyzes the frequency with which Heilbronn's criterion applies to polynomials f that are Eisenstein at a prime p, thereby implying that the associated number field K=Q[x]/(f) is not norm-Euclidean. Using a sieve-like framework with local densities, the authors derive a lower bound on the proportion of p-Eisenstein polynomials for which Heilbronn's criterion holds, and show this proportion approaches 1 as p grows, uniformly in odd n≥3 under gcd(p−1,n)=1 (with a version for relaxed gcd conditions). A key outcome is that a positive proportion of Eisenstein polynomials of any fixed degree n≥2 fail to generate norm-Euclidean fields. The results leverage explicit local density computations, no-root conditions modulo primes, and controlled representations of p as linear combinations of small primes to invoke Heilbronn's criterion.

Abstract

Heilbronn gave a sufficient condition for a number field with a totally ramified prime to fail to be norm-Euclidean. We say that Heilbronn's criterion applies to a polynomial $f$ if it applies to the number field $K=\mathbb{Q}[x]/(f)$ generated by $f$. Suppose $n\geq 3$ is odd and $p\geq 5$ is prime with $\gcd(p-1,n)=1$. Let $\mathcal{F}_{p,n}$ denote the collection of monic polynomials $f\in\mathbb{Z}[x]$ of degree $n$ that are Eisenstein at the prime $p$. We order our polynomials by the natural height $\mathrm{Ht}(f)$. Define $δ_{p,n}(X)$ to be the proportion of polynomials $f\in\mathcal{F}_{p,n}$ with $\mathrm{Ht}(f)\leq X$ for which Heilbronn's criterion applies. One has $$\liminf_{X\to\infty}δ_{p,n}(X)\geq \max\left\{\frac{2}{27}\,,\;1-\varepsilon(p)\right\}\,,$$ where $\varepsilon(p)\to 0$ and is effectively computable. In particular, the lower density tends to $1$ as $p\to\infty$ uniformly in $n$. We also give a version of this result where we weaken the condition on $\gcd(p-1,n)$. As a corollary, we show that given an integer $n\geq 2$, a positive proportion of Eisenstein polynomials of degree $n$ fail to generate norm-Euclidean fields.

Polynomial densities and Heilbronn's criterion

TL;DR

This work analyzes the frequency with which Heilbronn's criterion applies to polynomials f that are Eisenstein at a prime p, thereby implying that the associated number field K=Q[x]/(f) is not norm-Euclidean. Using a sieve-like framework with local densities, the authors derive a lower bound on the proportion of p-Eisenstein polynomials for which Heilbronn's criterion holds, and show this proportion approaches 1 as p grows, uniformly in odd n≥3 under gcd(p−1,n)=1 (with a version for relaxed gcd conditions). A key outcome is that a positive proportion of Eisenstein polynomials of any fixed degree n≥2 fail to generate norm-Euclidean fields. The results leverage explicit local density computations, no-root conditions modulo primes, and controlled representations of p as linear combinations of small primes to invoke Heilbronn's criterion.

Abstract

Heilbronn gave a sufficient condition for a number field with a totally ramified prime to fail to be norm-Euclidean. We say that Heilbronn's criterion applies to a polynomial if it applies to the number field generated by . Suppose is odd and is prime with . Let denote the collection of monic polynomials of degree that are Eisenstein at the prime . We order our polynomials by the natural height . Define to be the proportion of polynomials with for which Heilbronn's criterion applies. One has where and is effectively computable. In particular, the lower density tends to as uniformly in . We also give a version of this result where we weaken the condition on . As a corollary, we show that given an integer , a positive proportion of Eisenstein polynomials of degree fail to generate norm-Euclidean fields.

Paper Structure

This paper contains 7 sections, 11 theorems, 47 equations.

Key Result

Lemma 1.1

Let $K$ be a number field of degree $n$. Let $p$ be a prime that is totally ramified in $K$. If we can write $p=a+b$ where $\{a,-b\}$ are not norms and $a$ is an $n$-th power residue modulo $p$, then $K$ is not norm-Euclidean.

Theorems & Definitions (24)

  • Lemma 1.1: Heilbronn's criterion
  • Theorem 1.2
  • Theorem 1.3
  • Corollary 1.4
  • Lemma 2.1
  • proof
  • Lemma 2.2
  • proof
  • Lemma 2.3
  • proof
  • ...and 14 more