University of Cambridge > Talks.cam > Combinatorics Seminar > Colouring the real numbers and sum-sets with repetitions

Colouring the real numbers and sum-sets with repetitions

Add to your list(s) Download to your calendar using vCal

  • UserDaniel Soukup (Universioty of Vienna)
  • ClockThursday 22 November 2018, 16:00-17:00
  • HouseMR12.

If you have a question about this talk, please contact Andrew Thomason.

This talk will focus on relatives of Hindman’s finite sums theorem. In particular, we consider finite partitions of the set of real numbers and look for the existence of large (i.e., infinite or even uncountable) sets X so that X+X is fully contained in one class of the partition. In the case when repetitions are allowed, we discuss how the existence of even a countably infinite monochromatic sum-set heavily depends on the set-theoretic universe. However, the talk should be accessible to all with a minimal background in set theory.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity