COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Finite permutation groups: the landscape post-CFSG

## Finite permutation groups: the landscape post-CFSGAdd to your list(s) Download to your calendar using vCal - Peter Cameron (University of St Andrews; Queen Mary University of London)
- Thursday 09 January 2020, 15:00-16:00
- Seminar Room 1, Newton Institute.
If you have a question about this talk, please contact info@newton.ac.uk. GRAW01 - Introductory/instructional workshop In the 40 years since the Classification of Finite Simple Groups was first (tentatively) announced, our understanding of finite permutation groups has been radically transformed: previously untouchable classical problems have been solved, many new classifications produced, and applications to a wide area of mathematics, from number theory to computer science, have been developed. In this lecture I will outline the theory of finite permutation groups and explain how, using the O'Nan—Scott Theorem, CFSG can be brought to bear on various questions. In some cases, proofs avoiding CFSG have subsequently been found; but there are some interesting challenges where this has not so far proved possible. This talk is part of the Isaac Newton Institute Seminar Series series. ## This talk is included in these lists:- All CMS events
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
- bld31
Note that ex-directory lists are not shown. |
## Other listsCambridge Climate Economics First Cambridge-Nanzan Syntax Workshop## Other talksSocial Physiology for Precision Psychiatry Stepping up climate change mitigation Mood Instability: a possible transdiagnostic construct in psychopathology? Longevity, senescence and reproductive variation in wild African elephants. Plant Sciences Departmental Seminars - date to be found |