scientific article; zbMATH DE number 2133330
character tablescomputational group theorycoset enumerationfinitely presented groupsmatrix group recognitionpermutation group algorithmstextbook
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to group theory (20-01) Software, source code, etc. for problems pertaining to group theory (20-04) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Grammars and rewriting systems (68Q42) Algebraic theory of languages and automata (68Q70) Symbolic computation and algebraic computation (68W30)
Over the last 10-15 years the use of computational methods, in particular using the systems \texttt{GAP} and \texttt{Magma}, has become an established technique in group theory. Unfortunately this conflicts with the fact that much of the methods used in these systems were published only in research-level papers or theses or even were only ``published in the form of computer code. This situation has been undesirable not only with respect to the intellectual aspect of ``knowing what happens inside, but also because an efficient use of computation typically requires some knowledge of the methods employed to enable the user to ask the right question, a point strongly made by \textit{J. Neubüser} [``An invitation to computational group theory, Lond. Math. Soc. Lect. Note Ser. 212, 457-475 (1995; Zbl 0861.20001)]. The work under review finally resolves this dilemma and gives a comprehensive description of the area of Computational Group Theory. The book starts with a short historical chapter. Chapter 2 describes the basic concepts of Group Theory that will be used. Much of this will be familiar to a reader experienced in Group Theory. Chapter 3 starts the main corpus of the book with a description on how to represent groups on a computer and perform basic computations with them. Chapter 4 considers the basic theory of permutation group algorithms -- presented already in more detail in the monograph by \textit{Á. Seress} [Permutation group algorithms (2003; Zbl 1028.20002)], -- starting with blocks and going via stabilizer chains to backtrack algorithms and structural computations (\(p\)-core and solvable radical, a composition series algorithm is presented in chapter 10). Chapter 5 describes the algorithms for finitely presented groups that relate to coset enumeration. In contrast to the earlier monograph of \textit{C. C. Sims} [Computation with finitely presented groups (1994; Zbl 0828.20001)] the description here is ``classical, using coset tables. Chapter 6 combines the material of the two previous chapters to describe the computation of presentations for a given finite group. As application of this Sims' verification method for stabilizer chains is presented. The topic of chapter 7 is representation theory. Algorithms here concern the \texttt{MeatAxe} and variations, cohomological calculations as well as the Dixon-Schneider algorithm for the determination of a character table. It also considers computations in matrix groups, ending with a brief overview over the current research topic of Matrix Group Recognition. Chapter 8 describes the algorithmic theory for polycyclic groups, starting with polycyclic presentations and ending with algorithms for normalizer, conjugacy classes and automorphism group. Integration of this in the remaining text is slightly less tight than with the other chapters and general aspects of rewriting systems only come in a later chapter. Chapter 9 treats quotient algorithms, starting with a detailed description of Abelian quotients and Smith normal form computations and leading via a description of the \(p\)-quotient algorithm to methods for generating \(p\)-groups up to isomorphism. Chapter 10 returns to the topic of permutation groups. It describes computation of a chief series as well as the ``solvable radical method which generalizes many of the algorithms for polycyclic groups to the case of general permutation groups and is the basis of many current algorithms for permutation groups that go beyond a chief series. This method is illustrated extensively with the example of computing the subgroup lattice. Chapter 11 describes the availability and construction of several data bases for transitive and primitive permutation groups, perfect groups and groups of small order. Chapter 12 covers the basic ideas of rewriting systems which can be considered a generalization of the concept of polycyclic groups. Chapter 13 finally describes the algorithmic theory of automatic groups. Overall the material of this book covers all one could expect from a single book. (Just giving reference to the original publications covered is virtually impossible without duplicating the book's extensive bibliography.) The book is written on the level of a graduate textbook which brings the reader with knowledge of a basic algebra course essentially up to the level of current research. Much of the existing literature is carefully and concisely described (as this reviewer can testify concerning his thesis). Algorithms are described on a level that includes a reasonable level of optimization without getting lost in granular details of programming tricks. (For example a coding by the reviewer of the low-index algorithm following the book's description in section 5.4.2 produced a competitive implementation at first attempt.) In these aspects the book resembles most closely the work by \textit{H. Cohen} [A course in computational algebraic number theory (1993; Zbl 0786.11071)] for algebraic number theory. The work has been very carefully edited, as witnessed by the very small number of erratas for a work of this magnitude. Many of the algorithms are illustrated by meaningful examples. Having taught a course on Computational Group Theory following this book, this reviewer's only desideratum concerns the choice of parameters: It would have been easier to consider certain variables as ``global for this section in the book instead of passing them to all functions by ``call-by-reference. But this is bordering on paranoia and cannot distract from the overall excellence of this work. This handbook will be an indispensable tool for any researcher who uses (even without designing algorithms herself) computation in algebra. No household should be without a copy.
- Fundamental algorithms for permutation groups
- Working with finite groups
- Representations of groups. A computational approach.
- Computation with linear algebraic groups
- Group theory and computation. Invited papers based on the presentations at the workshop `Group theory and computational methods', Bangalore, India, November 5--14, 2016
- Computing the nonabelian tensor squares of polycyclic groups.
- Introduction to: Computational group theory II
- Fundamental algorithms for permutation groups
- Computational group theory in St. Petersburg
- Hyper-algebras of vector-valued modular forms
- Word problems of groups: formal languages, characterizations and decidability
- Effective subgroup separability of finitely generated nilpotent groups
- Random nilpotent groups, polycyclic presentations, and Diophantine problems
- Small partial Latin squares that embed in an infinite group but not into any finite group
- On the embedding of central extensions into permutation wreath products
- Enumeration of conformers for octahedral \textit{trans}/\textit{cis}-[MX\(_2\)(AB)\(_4\)] and \textit{trans}/\textit{cis}-[MX\(_2\)(ABC)\(_4\)] complexes on the basis of computational group theory
- Products of vector valued Eisenstein series
- Computing subfields of number fields and applications to Galois group computations
- Low time complexity algorithms for path computation in Cayley graphs
- Maximal linear groups induced on the Frattini quotient of a \(p\)-group
- Minimal and canonical images
- Computing stable epimorphisms onto finite groups
- Calculating characters of \(p\)-groups
- Optimal line packings from nonabelian groups
- Automorphism groups of 2-groups of coclass at most 3
- The use of permutation representations in structural computations in large finite matrix groups
- On the semigroup rank of a group
- From automatic structures to automatic groups.
- Subquadratic-time algorithms for normal bases
- Disjoint direct product decompositions of permutation groups
- Groups whose orders factorise into at most four primes
- Computation of orders and cycle lengths of automorphisms of finite solvable groups
- Primitive normalisers in quasipolynomial time
- Modular flavor symmetry and vector-valued modular forms
- Faster tensor canonicalization
- A Lyndon's identity theorem for one-relator monoids
- Computing normalisers of intransitive groups
- Residual dimension of nilpotent groups
- Universal covers of finite groups
- Generation of finite groups with cyclic Sylow subgroups
- Solving a fixed number of equations over finite groups
- Polynomial-time proofs that groups are hyperbolic
- Deciding finiteness of matrix groups in positive characteristic.
- A simple group generated by involutions interchanging residue classes of the integers.
- Improved method for finding optimal formulas for bilinear maps in a finite field
- Construction of the irreducible modular representations of a finite group
- Isomorphism testing of groups of cube-free order
- A polycyclic presentation for the \(q\)-tensor square of a polycyclic group
- Linear groups and computation
- An algorithm for decomposing representations of finite groups using invariant projections
- New classes of quantum codes on closed orientable surfaces
- Some computational aspects of solvable regular covers of graphs
- Symmetry type graphs of polytopes and maniplexes
- Enumeration of conformers for octahedral \([\mathrm{MX(AB)}_{5}]\) and \([\mathrm{MX(ABC)}_{5}]\) complexes on the basis of computational group theory
- Computational aspects of Burnside rings. I: The ring structure
- An algorithm for canonical forms of finite subsets of \(\mathbb {Z}^d\) up to affinities
- Baby-step giant-step algorithms for the symmetric group
- Constructive recognition of classical groups in even characteristic.
- Computing conjugacy classes of elements in matrix groups.
- Computing polycyclic presentations for polycyclic rational matrix groups.
- String rewriting for double coset systems.
- Constructive Sylow theorems for the classical groups.
- Using the Mal'cev correspondence for collection in polycyclic groups.
- Algorithms for computing with nilpotent matrix groups over infinite domains.
- Recognising the Suzuki groups in their natural representations.
- A computer-assisted analysis of some matrix groups.
- Computing conjugacy class representatives in permutation groups.
- Computing the soluble radical of a permutation group.
- Matrix representations for torsion-free nilpotent groups by Deep Thought.
- Explicit representations of maximal subgroups of the Monster.
- Computational group theory.
- On isomorphism testing of groups with normal Hall subgroups
- Fibonacci groups F(2,n) are hyperbolic for n odd and n 11
- Groups with a solvable subgroup of prime-power index
- On the Frattini subgroup of a polycyclic group
- Mathematical frameworks for oscillatory network dynamics in neuroscience
- Recognition of finite exceptional groups of Lie type.
- Orbits of crystallographic embedding of non-crystallographic groups and applications to virology
- Exploiting symmetries in polyhedral computations
- The automorphism group of a finitely generated virtually abelian group.
- Factorizations of finite groups by conjugate subgroups which are solvable or nilpotent
- Computing Hilbert class polynomials with the Chinese remainder theorem
- On the action of the sporadic simple Baby Monster group on its conjugacy class 2B.
- Computing a chief series and the soluble radical of a matrix group over a finite field.
- Computing in unipotent and reductive algebraic groups.
- scientific article; zbMATH DE number 5976624 (Why is no real title available?)
- Minimum circuit size, graph isomorphism, and related problems
- Classifying semisimple orbits of \theta -groups
- A class of descendant \(p\)-groups of order \(p^{9}\) and Higman's PORC conjecture
- Duality between \(p\)-groups with three characteristic subgroups and semisimple anti-commutative algebras
- Equivariant simplicial reconstruction
- A parallel evolutionary approach to solving systems of equations in polycyclic groups
- The status of polycyclic group-based cryptography: a survey and open problems
- Testing polycyclicity of finitely generated rational matrix groups
- Efficient characteristic refinements for finite groups
- SCHREIER CONDITIONS ON CHIEF FACTORS AND RESIDUALS OF SOLVABLE-LIKE GROUP FORMATIONS
- On the application of computational group theory to the theory of groups.
- Algorithms for crystallographic groups
- Presentations of finite simple groups: a quantitative approach.
- Embedding theorems for tree-free groups.
- Representations of groups. A computational approach.
- The Markov chain Monte Carlo revolution
- An infinite Family of 4-Arc-Transitive Cubic Graphs Each with Girth 12
- A note on computing involution centralizers.
- The construction of finite solvable groups revisited.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4650358)