Monochromatic solutions to $x+y=z^2$ in the interval $[N,cN^4]$
P\'eter P\'al Pach

TL;DR
This paper improves the known bounds for the existence of monochromatic solutions to the equation x+y=z^2 in 2-colored natural numbers, reducing the interval size needed for guaranteed solutions.
Contribution
It provides a new proof of Green and Lindqvist's theorem and tightens the interval bounds for monochromatic solutions in 2-colorings.
Findings
Monochromatic solutions exist in every interval [N, 10^4 N^4] for large N.
A 2-coloring avoiding solutions is constructed in [N, (1/27)N^4], showing bounds are tight up to a constant factor.
The proof simplifies previous methods and improves the interval bounds for solutions.
Abstract
Green and Lindqvist proved that for any 2-colouring of , there are in\-fi\-ni\-tely many monochromatic solutions to . In fact, they showed the existence of a monochromatic solution in every interval with large enough . In this short note we give a different proof for their theorem and prove that a monochromatic solution exists in every interval with large enough . A 2-colouring of avoiding monochromatic solutions to is also presented, which shows that in only the constant factor can be reduced.
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.
