Handbook of Computational Group Theory by Derek F. Holt (Discrete Mathematics and Its Applications: Chapman & Hall/CRC) is about computational group theory, which we shall frequently abbreviate to CGT. The origins of this lively and active branch of mathematics can he traced back to the nineteenth and early twentieth centuries, but it has been flourishing particularly during the past 30 to 40 years. The aim of this book is to provide as complete a treatment as possible of all of the fundamental methods and algorithms in CGT, without straying above a level suitable for a beginning postgraduate student.
The most basic algorithms in CGT tend to be representation specific; that is, there are separate methods for groups given as permutation or matrix groups, groups defined by means of polycyclic presentations, and groups that are defined using a general finite presentation. The author has devoted separate chapters to algorithms that apply to groups in these different types of repre¬sentations, but there are other chapters that cover important methods involving more than one type. For example, Chapter 6 is about finding presentations of permutation groups and the connections between coset enumeration and methods for finding the order of a finite permutation group.
There is also included a chapter (Chapter 11) on the increasing number of precomputed stored libraries and databases of groups, character tables, etc. that are now publicly available. They have been playing a major rôle in CGT in recent years, both as an invaluable resource for the general mathematical public, and as components for use in some advanced algorithms in CGT. The library of all finite groups of order up to 2000 (except for order 1024) has proved to be particularly popular with the wider community.
It is inevitable that our choice of topics and treatment of the individual topics will reflect the authors' personal expertise and preferences to some extent. On the positive side, the final two chapters of the book cover appli¬cations of string-rewriting techniques to CGT (which is, however, treated in much greater detail, and the application of finite state automata to the computation of automatic structures of finitely presented groups. On the other hand, there may be some topics for which our treatment is more superficial than it would ideally be.
One such area is the complexity analysis of the algorithms of CGT. During the 1980s and 1990s some, for the most part friendly and respectful, rivalry developed between those whose research in CGT was principally directed to-wards producing better performance of their code, and those who were more interested in proving theoretical results concerning the complexity of the al¬gorithms. This study of complexity began with the work of Eugene Luks, who established a connection in his 1982 article between permutation group algorithms and the problem of testing two finite graphs for isomorphism. Our emphasis in this book will be more geared towards algorithms that per-form well in practice, rather than those with the best theoretical complexity. Fortunately, Seress' book includes a very thorough treatment of com¬plexity issues, and so we can safely refer the interested reader there. In any case, as machines become faster, computer memories larger, and bigger and bigger groups come within the range of practical computation, it is becom¬ing more and more the case that those algorithms with the more favourable complexity will also run faster when implemented.
The important topic of computational group representation theory and computations with group characters is perhaps not treated as thoroughly as it might be in this book. Some of the basic material is covered in Chapter 7, but there is unfortunately no specialized book on this topic.
One of the most active areas of research in CGT at the present time, both from the viewpoint of complexity and of practical performance, is the development of effective START TRANSACTION WITH CONSISTENT SNAPSHOT; /* 1567 = 16d144598f773e238028dbec7faf4033