Groups and Computation II
Will be published approx. on 28. February 1997
Book
Hardback
382 pages
978-0-8218-0516-9 (ISBN)
Description
The workshop 'Groups and Computations' took place at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers University in June 1995. This and an earlier workshop (see Groups and Computation, Finkelstein and Kantor, c1993, American Mathematical Society) held in October 1991 was aimed at merging theory and practice within the broad area of computation with groups. The primary goal of the previous workshop was to foster a dialogue between researchers studying the computational complexity of group algorithms and those engaged in the development of practical software. It was expected that this would lead to a deeper understanding of the mathematical issues underlying group computation and that this understanding would lead, in turn, to faster algorithms.Comment and subsequent work indicated that this goal had been achieved beyond expectations. The second workshop was designed to reinforce the progress in these directions. The scientific program consisted of invited lectures and research announcements, as well as informal discussions and software demonstrations. The eight extended talks discussed randomization, permutation groups, matrix groups, software systems, fast Fourier transforms and their applications to signal processing and data analysis, computations with finitely presented groups, and implementation and complexity questions. As in the previous workshop, speakers ranged from established researchers to graduate students.
More details
Series
Language
English
Place of publication
Providence
United States
Target group
Professional and scholarly
Illustrations
Illustrations
Weight
936 gr
ISBN-13
978-0-8218-0516-9 (9780821805169)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Content
Randomization in group algorithms: Conceptual questions by L. Babai Experimenting and computing with infinite groups by G. Baumslag and C. M. III Towards polynomial time algorithms for matrix groups by R. Beals Calculating the order of an invertible matrix by F. Celler and C. R. Leedham-Green A non-constructive recognition algorithm for the special linear and other classical groups by F. Celler and C. R. Leedham-Green GAP/MPI: Facilitating parallelism by G. Cooperman Constructive recognition of a black box group isomorphic to $GL(n,2)$ by G. Cooperman, L. Finkelstein, and S. Linton Special presentations for finite soluble groups and computing (pre-)Frattini subgroups by B. Eick Algorithms for group actions applied to graph generation by T. Gruner, R. Laue, and M. Meringer Partitions, refinements, and permutation group computation by J. S. Leon A polycyclic quotient algorithm by E. H. Lo Computing the Fitting subgroup and solvable radical for small-base permutation groups in nearly linear time by E. M. Luks and A. Seress Generalized FFT's--A survey of some recent results by D. K. Maslen and D. M. Rockmore The complexity of McKay's canonical labeling algorithm by T. Miyazaki On nearly linear time algorithms for Sylow subgroups of small base permutation groups by P. Morje Implementing a recognition algorithm for classical groups by A. C. Niemeyer and C. E. Praeger Algorithms for polycyclic-by-finite matrix groups by G. Ostheimer Asymptotic results for simple groups and some applications by L. Pyber Some applications of generalized FFT's by D. M. Rockmore Computing permutation representations for matrix groups in parallel environments by M. Tselman.