Jing Zhang: How to get the brightest rainbows from the darkest colorings

Mathematical logic seminar – Sep 18 2018
Time:     3:30pm – 4:30 pm

Room:     Wean Hall 8220

Speaker:         Jing Zhang
Department of Mathematical Sciences
CMU

Title:     How to get the brightest rainbows from the darkest colorings

Abstract:

We will discuss the rainbow (sometimes called polychromatic) variation of the Ramsey theorem on uncountable cardinals. It roughly says if a given coloring on n-tuples satisfies that each color is not used too many times, we can always find a rainbow subset, that is a set in which no two n-tuples from the set get the same color. We will use problems in different settings (inaccessible cardinals, successors of singular cardinals, small uncountable cardinals etc) to demonstrate that the rainbow variation is a “strict combinatorial weakening” of Ramsey theory.

Leave a Reply

Your email address will not be published. Required fields are marked *

Time limit is exhausted. Please reload CAPTCHA.

This site uses Akismet to reduce spam. Learn how your comment data is processed.