PERMUTATION GROUPS (London Mathematical Society Student Texts 45)
PERMUTATION GROUPS (London Mathematical Society Student Texts 45)
复制标题
DOI:
10.1112/s0024609300217359
复制
发表时间:
2000-11
影响因子:
0.9
通讯作者:
G. Jones
中科院分区:
文献类型:
--
作者:
G. Jones
The early development of group theory was, to a large extent, that of permutation groups—specifically Galois groups, permuting the roots of polynomials. By the end of the nineteenth century, however, the axiomatic approach to group theory was beginning to take over, and despite the discoveries of Jordan, Burnside, Frobenius, Schur and Wielandt on permutation groups, the next 60–70 years saw group theory increasingly concerned with abstract groups: Marshall Hall’s book [3] devotes just one chapter out of twenty to permutation groups, and Schenkman [4] almost completely ignores them, even when discussing Frobenius groups. Recent decades, however, have seen a rebirth of the subject. During the classification of finite simple groups, an effective technique for constructing or eliminating a conjectured simple group was to represent it as a permutation group; the classifiers, having (more or less) achieved their goal, have repaid the compliment by turning much of finite permutation group theory from a study of axioms into a study of lists. Close links have been developed with algebraic combinatorics, through such concepts as orbital graphs, coherent configurations and association schemes, while infinite permutation group theory has also found fruitful links with model theory and topology. Developments in computing have turned finite group theory and algebraic combinatorics into experimental sciences, with systems such as GAP, MAGMA, GRAPE and COCO allowing the investigation of permutation groups and combinatorial structures of previously inaccessible size and complexity. Despite all these exciting developments, students of permutation groups have until recently been held back by the lack of a comprehensive and up-to-date textbook: Wielandt’s classic Finite permutation groups [6] concisely summarises the position up to about 1960, books by Cameron, Passman, Tamaschke, Tsuzuku and Wielandt illuminate particular areas of the subject, and survey articles by Cameron [1] and others give a broad overview, but it was not until the publication in 1996 of the books by Dixon and Mortimer [2] and by Suprunenko [5] that comprehensive treatments were available, taking account of the developments listed above. Cameron’s latest book is based on a one-week course given at the Euler Institute for Discrete Mathematics and its Applications, with five of the seven chapters (on general theory, representation theory, the O’Nan–Scott Theorem, oligomorphic groups, and miscellanea) each corresponding to a day’s work; a chapter on coherent configurations and a chapter of tables were added later. As the author admits, ‘ the choice of topics is a bit idiosyncratic ; this is not a complete treatment of the subject ’, and the book is best read with access to Dixon and Mortimer, to whom Cameron delegates the task of proving some of the more detailed results. Certain topics, such as Frobenius groups, are sensibly avoided since thorough treatments can be found elsewhere. Nevertheless, Cameron’s masterly expository style allows him to cover an enormous amount of ground, often simply sketching a proof or illustrating it with a well-chosen example, and encouraging the reader to gain experience by tackling a