Representing multiples of $m$ in real quadratic fields as sums of squares
Martin Ra\v{s}ka

TL;DR
This paper investigates conditions under which multiples of integers in real quadratic fields can be expressed as sums of squares, providing sharp criteria, an efficient algorithm, and comprehensive results for multiples up to 5000.
Contribution
It establishes precise necessary and sufficient conditions for representing multiples as sums of squares in real quadratic fields and offers a fast algorithm for specific cases.
Findings
Sharp necessary and sufficient conditions derived
Algorithm developed for specific m, D
Complete results for m ≤ 5000
Abstract
We study real quadratic fields such that, for a given rational integer , all -multiples of totally positive integers are sums of squares. We prove quite sharp necessary and sufficient conditions for this to happen. Further, we give a fast algorithm that solves this question for specific , and we give complete results for .
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
TopicsAnalytic Number Theory Research · Algebraic Geometry and Number Theory · Advanced Differential Equations and Dynamical Systems
