On the Number of Eisenstein Polynomials of Bounded Height
Randell Heyman, Igor E. Shparlinski

TL;DR
This paper refines the asymptotic count of monic Eisenstein polynomials of fixed degree and bounded height, providing explicit error bounds and extending results to all Eisenstein polynomials.
Contribution
It offers a more precise asymptotic formula with explicit error bounds for counting Eisenstein polynomials of bounded height, extending prior work to non-monic cases.
Findings
Explicit asymptotic formula for monic Eisenstein polynomials
Error bounds for the asymptotic approximation
Asymptotic count for all Eisenstein polynomials
Abstract
We obtain a more precise version of an asymptotic formula of A. Dubickas for the number of monic Eisenstein polynomials of fixed degree and of height at most , as . In particular, we give an explicit bound for the error term. We also obtain an asymptotic formula for arbitrary Eisenstein polynomials of height at most .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Algebraic Geometry and Number Theory
