Polynomial densities and 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.
Cite
@article{arxiv.2512.16220,
title = {Polynomial densities and Heilbronn's criterion},
author = {Alexis Hibbler and Kevin J. McGown and Enrique Treviño},
journal= {arXiv preprint arXiv:2512.16220},
year = {2025}
}