BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Permutation groups and relational complexity - Colva Roney-Dougal 
 (University of St Andrews)
DTSTART:20220728T100000Z
DTEND:20220728T103000Z
UID:TALK176573@talks.cam.ac.uk
DESCRIPTION:The notion of relational complexity originated in model theory
 \, and is a measure of the extent to which local information about the act
 ion of a finite permutation group determines each element: unsurprisingly 
 there is a connection with base size. &nbsp\;This talk will start with som
 e basic definitions and examples\, and then present some new bounds on the
  relational complexity of various families of permutation groups.\nThis is
  work in progress with Saul Freedman and Veronica Kelsey.&nbsp\;
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR