A note on additive complements of the squares
Yuchen Ding, Yu-Chen Sun, Li-Yuan Wang, Yutong Xia

TL;DR
This paper improves bounds on the representation function related to additive complements of squares and advances understanding of a problem posed by Ben Green, showing new asymptotic behavior of the sequence involved.
Contribution
It refines previous lower bounds on the sum of representation counts and makes progress on Green's problem by establishing a new limsup inequality.
Findings
Improved the lower bound of the sum of representation counts to N^{1/2}
Established a new asymptotic inequality related to the sequence w_n
Progressed on a problem posed by Ben Green regarding the sequence's growth
Abstract
Let be the set of squares and be an additive complement of so that for some . Let . In 2017, Chen-Fang \cite{C-F} studied the lower bound of . In this note, we improve Cheng-Fang's result and get that As an application, we make some progress on a problem of Ben Green problem by showing that
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
Topicsgraph theory and CDMA systems · Limits and Structures in Graph Theory · Finite Group Theory Research
