Groups and computation

Author(s)

• Finkelstein, Larry A.
• Kantor, W. M. (William M.)
• DIMACS workshop on Groups and computation

Bibliographic Information

Groups and computation

Larry Finkelstein, William M. Kantor, editors

（DIMACS series in discrete mathematics and theoretical computer science, v. 11, 28）

American Mathematical Society, c1993-

• [1]
• 2

Note

V. 1:Papers from the workshop held at DIMACS, Rutgers University, Oct. 7-10, 1991

V. 2:Papers from the workshop held at DIMACS, Rutgers University, June 7-10, 1995

"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science. A consortium of Rutgers University, Princeton University, AT&T Labs, Bell Labs, and Bellcore."-- v. 2

"The second DIMACS workshop on Groups and Computation took place during Jane 1995. The first meeting was held in October 1991 at DIMACS; ... "--v. 2, Foreword

Includes bibliographical references

Description and Table of Contents

Description

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 groups by L. Babai, E. M. Luks, and A. Seress Computing blocks of imprimitivity for small-base groups in nearly linear time by R. Beals Fast Fourier transforms for symmetric groups by M. Clausen and U. Baum From hyperbolic reflections to finite groups by J. H. Conway Combinatorial tools for computational group theory by G. Cooperman and L. Finkelstein Efficient computation of isotypic projections for the symmetric group by P. Diaconis and D. Rockmore Constructing representations of finite groups by J. D. Dixon A graphics system for displaying finite quotients of finitely presented groups by D. F. Holt and S. Rees Random remarks on permutation group algorithms by W. M. Kantor Application of group theory to combinatorial searches by C. W. H. Lam Permutation groups and polynomial-time computation by E. M. Luks Parallel computation of Sylow subgroups in solvable groups by P. D. Mark Computation with matrix groups over finite fields by C. E. Praeger Asymptotic results for permutation groups by L. Pyber Computations in associative algebras by L. Ronyai Cayley graphs and direct-product graphs by A. L. Rosenberg Group membership for groups with primitive orbits by N. Sarawagi, G. Cooperman, and L. Finkelstein PERM: A program computing strong generating sets by A. Seress and I. Weisz Complexity issues in infinite group theory by C. C. Sims GRAPE: A system for computing with graphs and groups by L. H. Soicher Implications of parallel architectures for permutation group computations by B. W. York.

by "Nielsen BookData"

Details

• NCID: BA20908418
• ISBN:
  • 0821865994
  • 0821805169
• LCCN: 93004968
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Providence, RI
• Pages/Volumes: v.
• Size: 27 cm
• Classification:
  • LCC : QA174.7.D36
  • DC20 : 512/.2
• Subject Headings:
  • LCSH : Group theory -- Data processing -- Congresses
  • LCSH : Algebra -- Data processing -- Congresses
• Parent Bibliography ID:
  • BA12282377