Monogenic pure cubics
Zafer Selcuk Aygin, Khoa D. Nguyen

TL;DR
This paper investigates the frequency of monogenic pure cubic fields generated by certain square-free integers and polynomials, providing bounds on their count and assuming ABC conjecture for sharper estimates.
Contribution
It establishes asymptotic bounds for the number of monogenic pure cubic fields over both number fields and finite fields, including unconditional and conditional results.
Findings
Number of such fields grows at least as fast as N^{1/3}
Upper bounds are N divided by a logarithmic factor, improved under ABC
Analogous finite field results are also proven
Abstract
Let be a square-free integer. We prove that the number of square-free integers such that and is monogenic is and for any . Assuming ABC, the upper bound can be improved to . Let be the finite field of order with and let be non-constant square-free. We prove unconditionally the analogous result that the number of square-free such that , and is monogenic is and .
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.
