Groups and computation
Author(s)
Bibliographic Information
Groups and computation
（DIMACS series in discrete mathematics and theoretical computer science, v. 11,
American Mathematical Society, c1993-
- [1]
- 2
Available at / 31 libraries
-
Toyohashi University of Technology Library図
[1]411.6||DI||199197900568,
2411.6||DI||199597900289 -
No Libraries matched.
- Remove all filters.
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
- Volume
-
2 ISBN 9780821805169
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.
Table of Contents
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.
- Volume
-
[1] ISBN 9780821865996
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"