University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Permutation groups and relational complexity

  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

Permutation groups and relational complexity

Download to your calendar using vCal

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

GR2W02 - Simple groups, representations and applications

The notion of relational complexity originated in model theory, and is a measure of the extent to which local information about the action of a finite permutation group determines each element: unsurprisingly there is a connection with base size.  This talk will start with some basic definitions and examples, and then present some new bounds on the relational complexity of various families of permutation groups. This is work in progress with Saul Freedman and Veronica Kelsey. 

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

SPRI Seminar Room Average on weekdays: 8923.98046875 kWh MR20 Centre for Mathematical Sciences

Other talks

Formalising mathematics and spectral geometry in Lean Scattering Plenty: the people who made the modern countryside Ice in a mostly-Arctic Context A flexible Monte Carlo quantitative bias analysis for unmeasured confounding Cambridge RNA Club - IN PERSON Filial Lines: Art Spiegelman, Alison Bechdel, and Comics Form
 

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