Hardcover ISBN:  9780821865996 
Product Code:  DIMACS/11 
List Price:  $100.00 
MAA Member Price:  $90.00 
AMS Member Price:  $80.00 
eBook ISBN:  9781470439699 
Product Code:  DIMACS/11.E 
List Price:  $94.00 
MAA Member Price:  $84.60 
AMS Member Price:  $75.20 
Hardcover ISBN:  9780821865996 
eBook: ISBN:  9781470439699 
Product Code:  DIMACS/11.B 
List Price:  $194.00 $147.00 
MAA Member Price:  $174.60 $132.30 
AMS Member Price:  $155.20 $117.60 
Hardcover ISBN:  9780821865996 
Product Code:  DIMACS/11 
List Price:  $100.00 
MAA Member Price:  $90.00 
AMS Member Price:  $80.00 
eBook ISBN:  9781470439699 
Product Code:  DIMACS/11.E 
List Price:  $94.00 
MAA Member Price:  $84.60 
AMS Member Price:  $75.20 
Hardcover ISBN:  9780821865996 
eBook ISBN:  9781470439699 
Product Code:  DIMACS/11.B 
List Price:  $194.00 $147.00 
MAA Member Price:  $174.60 $132.30 
AMS Member Price:  $155.20 $117.60 

Book DetailsDIMACS  Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 11; 1993; 313 ppMSC: Primary 20
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.
Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were copublished with the Association for Computer Machinery (ACM).
ReadershipResearch mathematicians and computer scientists.

Table of Contents

Chapters

Computing composition series in primitive groups

Computing blocks of imprimitivity for smallbase 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 polynomialtime 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 directproduct 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


RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
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.
Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were copublished with the Association for Computer Machinery (ACM).
Research mathematicians and computer scientists.

Chapters

Computing composition series in primitive groups

Computing blocks of imprimitivity for smallbase 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 polynomialtime 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 directproduct 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