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

Permutation groups and relational complexity

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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