Finite Groups Iii

Finite Groups III

Und dann erst kommt der "Ab -ge - sa. ng\' da. /3 der nidlt kurz und nicht zu la. ng, From "Die Meistersinger von Nürnberg", Richard Wagner This final volume is concerned with some of the developments of the subject in the 1960's. In attempting to determine the simple groups, the first step was to settle the conjecture of Burnside that groups of odd order are soluble. The proof that this conjecture was correct is much too long and complicated for presentation in this text, but a number of ideas in the early stages of it led to a local theory of finite groups, so me aspects of which are discussed in Chapter X. Much of this discussion is a con tinuation of the theory of the transfer (see Chapter IV), but we also introduce the generalized Fitting subgroup, which played a basic role in characterization theorems, that is, in descriptions of specific groups in terms of group-theoretical properties alone. One of the earliest and most important such characterizations was given for Zassenhaus groups; this is presented in Chapter XI. Characterizations in terms of the centralizer of an involution are of particular importance in view of the theorem of Brauer and Fowler. In Chapter XII, one such theorem is given, in which the Mathieu group 9J'l1l and PSL(3, 3) are characterized

Groups and Computation III

This volume contains contributions by the participants of the conference "Groups and Computation", which took place at The Ohio State University in Columbus, Ohio, in June 1999. This conference was the successor of two workshops on "Groups and Computation" held at DIMACS in 1991 and 1995. There are papers on permutation group algorithms, finitely presented groups, polycyclic groups, and parallel computation, providing a representative sample of the breadth of Computational Group Theory. On the other hand, more than one third of the papers deal with computations in matrix groups, giving an in-depth treatment of the currently most active area of the field. The points of view of the papers range from explicit computations to group-theoretic algorithms to group-theoretic theorems needed for algorithm development.

Finite Groups III