Title:
Groups and computation
Personal Author:
Series:
DIMACS series in discrete mathematics and theoretical computer science ; 11
Publication Information:
Providence, R.I. : American Mathematical Society, 1993
ISBN:
9780821865996
General Note:
Workshop on Groups and Computation October 7-10, 1991
Added Author:
Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
|---|---|---|---|---|---|
Searching... | 30000003070665 | QA174.7.D36 G76 1993 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
This volume contains papers presented at the Workshop on Groups and Computation, held in October 1991. The workshop explored interactions among four areas: symbolic algebra and computer algebra, theoretical computer science, group theory, and applications of group computation. The relationships between implementation and complexity form a recurrent theme, though the papers also discuss such topics as parallel algorithms for groups, computation in associative algebras, asymptotic behavior of permutation groups, the study of finite groups using infinite reflection groups, combinatorial searching, computing with representations, and Cayley graphs as models for interconnection networks.
Table of Contents
| Computing composition series in primitive groupsL. Babai and E. M. Luks and A. Seress |
| Computing blocks of imprimitivity for small-base groups in nearly linear timeR. Beals |
| Fast Fourier transforms for symmetric groupsM. Clausen and U. Baum |
| From hyperbolic reflections to finite groupsJ. H. Conway |
| Combinatorial tools for computational group theoryG. Cooperman and L. Finkelstein |
| Efficient computation of isotypic projections for the symmetric groupP. Diaconis and D. Rockmore |
| Constructing representations of finite groupsJ. D. Dixon |
| A graphics system for displaying finite quotients of finitely presented groupsD. F. Holt and S. Rees |
| Random remarks on permutation group algorithmsW. M. Kantor |
| Application of group theory to combinatorial searchesC. W. H. Lam |
| Permutation groups and polynomial-time computationE. M. Luks |
| Parallel computation of Sylow subgroups in solvable groupsP. D. Mark |
| Computation with matrix groups over finite fieldsC. E. Praeger |
| Asymptotic results for permutation groupsL. Pyber |
| Computations in associative algebrasL. Ronyai |
| Cayley graphs and direct-product graphsA. L. Rosenberg |
| Group membership for groups with primitive orbitsN. Sarawagi and G. Cooperman and L. Finkelstein |
| PERM: A program computing strong generating setsA. Seress and I. Weisz |
| Complexity issues in infinite group theoryC. C. Sims |
| GRAPE: A system for computing with graphs and groupsL. H. Soicher |
| Implications of parallel architectures for permutation group computationsB. W. York |
