Date: Thursday, December 07, 2017
Location: 3096 East Hall (4:00 PM to 5:30 PM)
Title: More Ramseytheoretic statements: uncountably many colours, finite monochromatic sets
Abstract: Hindman's theorem states that for every colouring of an infinite abelian group with finitely many colours, there will be an infinite set whose finite sums are monochromatic. Increasing the number of colours to infinitely many makes the theorem fail, as does keeping the number of colours finite but requiring an uncountable monochromatic finitesum set. Recently Komjath discovered, however, that by increasing the number of colours to be infinite (even uncountable), and at the same time decreasing the size of our desired monochromatic set to a finite number, it is possible to obtain some positive Ramseytheoretic results. In this talk I will discuss some of these results, as well as some improvements and generalizations of them that I found over the summer, jointly with my REU student SungHyup Lee.
Files:
Speaker: David FernandezBreton
Institution: University of Michigan
Event Organizer: David FernandezBreton logiclist@umich.edu
