Papers
Topics
Authors
Recent
Search
2000 character limit reached

Pairwise sums in colourings of the reals

Published 11 May 2015 in math.CO | (1505.02500v1)

Abstract: Suppose that we have a finite colouring of the reals. What sumset-type structures can we hope to find in some colour class? One of our aims is to show that there is such a colouring for which no uncountable set has all of its pairwise sums monochromatic. We also show that there is such a colouring such that there is no infinite set X with X+X (the pairwise sums from X, allowing repetition) monochromatic. These results assume CH. In the other direction, we show that if each colour class is measurable, or each colour class is Baire, then there is an infinite set X (and even an uncountable X, of size the reals) with X+X monochromatic. We also give versions for all of these results for k-wise sums in place of pairwise sums.

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.

Collections

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