The Density of a family of monogenic number fields
Mohammad Bardestani

TL;DR
This paper investigates the density of primes for which certain monogenic number fields generated by polynomials of the form t^q - p are monogenic, providing lower bounds using the Chebotarev density theorem.
Contribution
It establishes lower bounds on the density of primes p such that t^q - p yields a monogenic number field, including specific results for q=3.
Findings
Density of primes p with monogenic t^q - p is at least (q-1)/q.
For q=3, at least 1/9 of primes p produce non-monogenic fields.
Uses Chebotarev density theorem to derive these density bounds.
Abstract
A monogenic polynomial is a monic irreducible polynomial with integer coefficients which produces a monogenic number field. For a given prime , using the Chebotarev density theorem, we will show the density of primes , such that is monogenic, is bigger or equal than . We will also prove that, when , the density of primes , which is non-monogenic, is at least 1/9.
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
TopicsAlgebraic Geometry and Number Theory · Analytic Number Theory Research · Meromorphic and Entire Functions
