COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

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

## Colouring the real numbers and sum-sets with repetitionsAdd to your list(s) Download to your calendar using vCal - Daniel Soukup (Universioty of Vienna)
- Thursday 22 November 2018, 16:00-17:00
- MR12.
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. ## This talk is included in these lists:- All CMS events
- All Talks (aka the CURE list)
- CMS Events
- Combinatorics Seminar
- DPMMS Lists
- DPMMS Pure Maths Seminar
- DPMMS info aggregator
- DPMMS lists
- MR12
- School of Physical Sciences
- bld31
Note that ex-directory lists are not shown. |
## Other listsREAL Centre Cavendish Thin Film Magnetism Group Coercion Lecture Series## Other talksMaking the tiniest machines Introduction to the early detection of cancer and novel interventions Ethics for the working mathematician, lecture 8: Looking into the future, what more can mathematicians do? Influencing axon regeneration after spinal cord injury 'As Far North As Whale Hunters Go': The Medieval Arctic Environment, Experienced and Imagined |