|Date: Thursday, March 31, 2022
Location: 2866 East Hall (4:00 PM to 5:30 PM)
Title: On Ramsey-like theorems on the rationals and the Rado graph
Abstract: Ramsey's theorem implies for every 2-coloring of pairs of naturals there is an infinite set H of naturals where all the pairs formed from H have the same color. We will explore how to extend this to the rationals, the Rado graph and some other relational homogenous countable structures. One of the main tools used in these extensions is Milliken's tree theorem and its recent modifications. Our goal is to try to understand the arithmetic complexity of the resulting "homogenous" set or structure. I.e. if the colorings are computable is there a "homogenous" structure within the arithmetical hierarchy and if so where.
Speaker: Peter Cholak
Institution: Notre Dame
Event Organizer: Andreas R Blass firstname.lastname@example.org