Unlimited lists of fundamental units of quadratic fields -- Applications to some arithmetic properties
Georges Gras (LMB)

TL;DR
This paper presents an elementary method to generate arbitrarily large lists of fundamental units and solutions in quadratic fields, with applications to non p-rational fields and fields with non-trivial p-class groups.
Contribution
It introduces a novel elementary process using specific polynomials to systematically produce fundamental units and solutions in quadratic fields, expanding the known examples and applications.
Findings
Generates large lists of fundamental units for quadratic fields.
Produces arbitrarily large lists of solutions to certain Pell-type equations.
Identifies non p-rational quadratic fields and fields with non-trivial p-class groups.
Abstract
We use the polynomials , , in an elementary process giving arbitrary large lists of {\it fundamental units} of quadratic fields of discriminants listed in ascending order. More precisely, let ; then as grows from to , for each {\it first occurrence} of a square-free integer , in the factorization , the unit is the fundamental unit of norm of , even if (Theorem 4.1). Using , , the algorithm gives arbitrary large lists of {\it fundamental solutions} to (Theorem 4.11). We deduce, for prime, arbitrary large lists of {\it non -rational} quadratic fields (Theorems 6.3, 6.4, 6.5) and of degree imaginary fields with non-trivial -class group…
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
TopicsComputability, Logic, AI Algorithms · Analytic Number Theory Research · Polynomial and algebraic computation
