Answers are grounded in this paper and cite their sources.
This analysis reveals norm-Euclidean failures in Eisenstein polynomials, suggesting significant density rates.
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=Q[x]/(f) generated by f . Suppose n≥ 3 is odd and p≥ 5 is prime with (p-1,n)=1 . Let Fp,n denote the collection of monic polynomials f∈ Z[x] of degree n that are Eisenstein at the prime p . Order the polynomials by the natural height Ht(f) . Define δ p,n(X) to be the proportion of polynomials f∈ Fp,n with Ht(f)≤ X for which Heilbronn’s criterion applies. Then, align* X→∞ δp,n(X)≥ max\2/27,\;1-ε(p)\, align* where ε (p)→ 0 and is effectively computable. In particular, the lower density tends to $1$ as p→ ∞ uniformly in n . We also give a version of this result where we weaken the condition on (p-1,n) . As a corollary, we show that given an integer n≥ 2 , a positive proportion of Eisenstein polynomials of degree n fail to generate norm-Euclidean fields.
No takes yet. Share an insight, caveat, or question.
HIBBLER et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: