Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 17 Aug 2020 in math.CO | (2008.07297v1)

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

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.