Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On monochromatic solutions to $x-y=z^2$ (2008.07297v1)

Published 17 Aug 2020 in math.CO

Abstract: 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=z2$. 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)}}}$.

Summary

We haven't generated a summary for this paper yet.