BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Andrew Brooke-Taylor (University of Leeds)
DTSTART:20230207T140000Z
DTEND:20230207T150000Z
DTSTAMP:20260421T153913Z
UID:UEAPS/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/UEAPS/1/">Co
 mplexity of classification problems</a>\nby Andrew Brooke-Taylor (Universi
 ty of Leeds) as part of ANTLR seminar\n\nLecture held in EFRY 01.05.\n\nAb
 stract\nThe notion of "Borel reducibility" gives a framework that allows u
 s to compare the complexities of different classes of mathematical objects
 .  I will give an introduction to this framework\, including how it has be
 en used to show that a number of proposed classification programmes in dif
 ferent areas of mathematics were impossible to realise.  I'll then talk ab
 out using the framework to explain why the knot invariants called "quandle
 s" are often considered to be too hard to work with (joint work with Sheil
 a Miller)\, and finish with a discussion of what happens when the framewor
 k is extended to capture functoriality (joint work with Filippo Calderoni)
 .\n
LOCATION:https://researchseminars.org/talk/UEAPS/1/
END:VEVENT
END:VCALENDAR