AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Groups and Computation
About this Title
Larry A Finkelstein and William M. Kantor, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1993; Volume 11
ISBNs: 978-0-8218-6599-6 (print); 978-1-4704-3969-9 (online)
DOI: https://doi.org/10.1090/dimacs/011
MathSciNet review: MR1235790
MSC: Primary 20-06; Secondary 20B40
ReadershipTable of Contents
Front/Back Matter
Chapters
- Computing composition series in primitive groups
- Computing blocks of imprimitivity for small-base groups in nearly linear time
- Fast Fourier transforms for symmetric groups
- From hyperbolic reflections to finite groups
- Combinatorial tools for computational group theory
- Efficient computation of isotypic projections for the symmetric group
- Constructing representations of finite groups
- A graphics system for displaying finite quotients of finitely presented groups
- Random remarks on permutation group algorithms
- Application of group theory to combinatorial searches
- Permutation groups and polynomial-time computation
- Parallel computation of Sylow subgroups in solvable groups
- Computation with matrix groups over finite fields
- Asymptotic results for permutation groups
- Computations in associative algebras
- Cayley graphs and direct-product graphs
- Group membership for groups with primitive orbits
- PERM: a program computing strong generating sets
- Complexity issues in infinite group theory
- GRAPE: a system for computing with graphs and groups
- Implications of parallel architectures for permutation group computations