First Annual Coven-Wood Lecture Series, Bjorn Poonen (MIT): 'How complicated can a field be?'

Tuesday, April 21, 2015
4:15 PM - 5:15 PM (ET)
ESC 121
Event Type
Academic Calendar
Contact
Philip Scowcroft
Department
Math/CS Other
Link
https://eaglet.wesleyan.edu/MasterCalendar/EventDetails.aspx?EventDetailId=63518

Abstract: Using ideas from arithmetic geometry, we show how to associate to each countable graph a field in such a way that the automorphism group is preserved. In computable model theory, it was known that countable graphs can encode the complexity of any countable structure. Using our construction, we can now similarly construct countable fields that are as complicated algorithmically as they could possibly be.

Get Directions
Event Date
Event Time
Title
Building