Sums of squares of integers from residue classes
Daejun Kim

TL;DR
This paper investigates the minimal number of squares needed to represent large integers as sums of squares from specific residue classes, establishing conditions for universality and calculating minimal sums.
Contribution
It characterizes when residue classes are s-square universal and determines the minimal number of squares needed in these cases.
Findings
Residue class $ ext{A}_{d,m}$ is s-square universal iff $d ot ot ext{equiv} ext{to} \pm 1 ext{mod} ext{m}$.
The minimal number $ ext{SU}( ext{A}_{d,m})$ is explicitly determined for universal classes.
The paper provides a complete characterization of s-square universality for residue classes.
Abstract
A subset is called -almost square universal if every sufficiently large positive integer can be written as a sum of at most squares of integers from . In this article, we study the minimal number with this property, where denotes the residue class of modulo , with and . We further prove that is -square universal for some if and only if , and determine the minimal such number in these cases.
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
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Computability, Logic, AI Algorithms
