
TL;DR
This paper investigates the probability of a number field having nontrivial subfields under different enumeration methods, showing it is zero when ordered by generator height for degrees greater than 6.
Contribution
It provides an asymptotic estimate for the count of algebraic numbers generating fields with specified subfields, clarifying the impact of enumeration method on probability.
Findings
Probability is zero when fields are ordered by generator height for degrees > 6.
Provides asymptotic formulas for algebraic numbers generating fields with given subfields.
Highlights the dependence of subfield probability on enumeration method.
Abstract
What is the probability for a number field of composite degree to have a nontrivial subfield? As the reader might expect the answer heavily depends on the interpretation of probability. We show that if the fields are enumerated by the smallest height of their generators the probability is zero, at least if . This is in contrast to what one expects when the fields are enumerated by the discriminant. The main result of this article is an estimate for the number of algebraic numbers of degree and bounded height which generate a field that contains an unspecified subfield of degree . If we get the correct asymptotics as the height tends to infinity.
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.
