arXiv Analytics

Sign in

arXiv:2008.07297 [math.CO]AbstractReferencesReviewsResources

On monochromatic solutions to $x-y=z^2$

Tom Sanders

Published 2020-08-17Version 1

For $k \in \mathbb{N}$, write $S(k)$ for the largest natural number such that there is a $k$-colouring of $\{1,\dots,S(k)\}$ with no monochromatic solution to $x-y=z^2$. That $S(k)$ exists is a result of Bergelson, and a simple example shows that $S(k) \geq 2^{2^{k-1}}$. The purpose of this note is to show that $S(k)\leq 2^{2^{2^{O(k)}}}$.

Comments: 6pp; for Endre Szemeredi's 80th Birthday volume
Journal: Acta Math. Hungar. 161 (2020), no. 2, 550-556
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1608.00109 [math.CO] (Published 2016-07-30)
Monochromatic Solutions to Systems of Exponential Equations
arXiv:2410.21651 [math.CO] (Published 2024-10-29)
Optimization Tools for Computing Colorings of $[1,\cdots ,n]$ with Few Monochromatic Solutions on $3$-variable Linear Equations
arXiv:2501.17136 [math.CO] (Published 2025-01-28, updated 2025-02-04)
On Monochromatic Solutions of Linear Equations Using At Least Three Colors