An Upper Bound on the Number of Classes of Perfect Unary Forms in Totally Real Number Fields
Christian Porter, Andrew Mendelsohn

TL;DR
This paper establishes an upper bound on the number of classes of perfect unary forms in totally real number fields, relating it to field invariants like discriminant and regulator, and extends results for unit reducible fields.
Contribution
It provides a new upper bound on the classes of perfect unary forms in totally real fields, incorporating field invariants and extending previous methods.
Findings
Bound depends on discriminant and regulator of the field.
For unit reducible fields, the bound simplifies to depend only on discriminant and degree.
The method adapts van Woerden's approach to this specific problem.
Abstract
Let be a totally real number field of degree over , with discriminant and regulator respectively. In this paper, using a similar method to van Woerden, we prove that the number of classes of perfect unary forms, up to equivalence and scaling, can be bounded above by , where is a finite value, satisfying if . Moreover, if is a unit reducible field, the number of classes of perfect unary forms is bound above by .
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 · Coding theory and cryptography
