University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > On Ramsey-like theorems on the rationals and the Rado graph

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

On Ramsey-like theorems on the rationals and the Rado graph

Download to your calendar using vCal

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

SASW09 - International conference on computability, complexity and randomness

Ramsey 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 it’s 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.   

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Main Lecture Theatre, Old Divinity School, All Saints Passage, St John's College, Cambridge 5.00pm-6.30 pm, Monday 5th Feb 2024: Online Teams MR11, Centre for Mathematical Sciences, Wilberforce Road, Cambridge

Other talks

The LMC-SMC System: A New Laboratory for Galaxy Evolution, Dynamics and Dark Matter Looking for intelligence in minds, machines and mathematics An AI-Assisted Proof in Spectral Geometry Sheref Mansy, topic TBA A novel hereditary encephalopathy in four related Labrador Retrievers associated with a missense variant in the ALDH5A1 gene’ Title to be confirmed
 

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