University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Invariable generation and totally deranged elements of simple groups

  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

Invariable generation and totally deranged elements of simple groups

Download to your calendar using vCal

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

GR2W02 - Simple groups, representations and applications

By a classical theorem of Jordan, every faithful transitive action of a nontrivial finite group admits a derangement (an element with no fixed points). More recently, the existence of derangements with additional properties has attracted much attention, especially for primitive actions of almost simple groups. Surprisingly, there exist almost simple groups with elements that are derangements in every faithful primitive action; we say that these elements are totally deranged. I’ll talk about ongoing work to classify the totally deranged elements of almost simple groups, and I’ll mention how this solves a question of Garzoni about invariable generating sets for simple groups.

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

Rooms SG1 & SG2, Alison Richard Building, 7 West Road, Cambridge, CB3 9DT Goldsmiths' Lecture Room 1, Department of Materials Science & Metallurgy, 27 Charles Babbage Road, CB3 0FS Department of Chemistry (BMS LT, entrance close to Scott Polar institute)

Other talks

Group Work How Much Does Homology Really Know? Online Causal Inference Seminar Overview of treatment for non-small cell lung cancer Carrollian momenta from anti de Sitter  Life, death, and the discovery of PDAR: the Pol II Degradation-dependent Apoptotic Response 
 

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