Permutation groups are one of the oldest topics in algebra. However, their study has recently been revolutionised by new developments, particularly the classification of finite simple groups, but also relations with logic and combinatorics, and importantly, computer algebra systems have been introduced that can deal with large permutation groups. This book gives a summary of these developments, including an introduction to relevant computer algebra systems, sketch proofs of major theorems, and many examples of applying the classification of finite simple groups. It is aimed at beginning graduate students and experts in other areas, and grew from a short course at the EIDMA institute in Eindhoven.
‘Cameron’s masterly style allows him to cover an enormous amount of ground … it is a delightful book, which every group-theorist should have, either to read systematically or to dip into in odd moments: a randomly-chosen page almost certainly contains something new and instructive.’
Gareth A. Jones Source: Bulletin of the London Mathematical Society
‘ … an excellent concise account of the modern theory of permutation groups …’
W. Knapp Source: Zentralblatt MATH
Loading metrics...
* Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.
Usage data cannot currently be displayed.
This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.
Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.