Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Groups and Computation II
 
Edited by: Larry Finkelstein Northeastern University, Boston, MA
William M. Kantor University of Oregon, Eugene, OR
A co-publication of the AMS and DIMACS
Groups and Computation II
Hardcover ISBN:  978-0-8218-0516-9
Product Code:  DIMACS/28
List Price: $114.00
MAA Member Price: $102.60
AMS Member Price: $91.20
eBook ISBN:  978-1-4704-3986-6
Product Code:  DIMACS/28.E
List Price: $107.00
MAA Member Price: $96.30
AMS Member Price: $85.60
Hardcover ISBN:  978-0-8218-0516-9
eBook: ISBN:  978-1-4704-3986-6
Product Code:  DIMACS/28.B
List Price: $221.00 $167.50
MAA Member Price: $198.90 $150.75
AMS Member Price: $176.80 $134.00
Groups and Computation II
Click above image for expanded view
Groups and Computation II
Edited by: Larry Finkelstein Northeastern University, Boston, MA
William M. Kantor University of Oregon, Eugene, OR
A co-publication of the AMS and DIMACS
Hardcover ISBN:  978-0-8218-0516-9
Product Code:  DIMACS/28
List Price: $114.00
MAA Member Price: $102.60
AMS Member Price: $91.20
eBook ISBN:  978-1-4704-3986-6
Product Code:  DIMACS/28.E
List Price: $107.00
MAA Member Price: $96.30
AMS Member Price: $85.60
Hardcover ISBN:  978-0-8218-0516-9
eBook ISBN:  978-1-4704-3986-6
Product Code:  DIMACS/28.B
List Price: $221.00 $167.50
MAA Member Price: $198.90 $150.75
AMS Member Price: $176.80 $134.00
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 281997; 382 pp
    MSC: Primary 20

    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, ©1993, 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. Comments 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.

    Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

    Readership

    Graduate students and research mathematicians interested in computational methods.

  • Table of Contents
     
     
    • Chapters
    • Randomization in group algorithms: Conceptual questions
    • Experimenting and computing with infinite groups
    • Towards polynomial time algorithms for matrix groups
    • Calculating the order of an invertible matrix
    • A non-constructive recognition algorithm for the special linear and other classical groups
    • GAP/MPI: Facilitating parallelism
    • Constructive recognition of a black box group isomorphic to $GL(n,2)$
    • Special presentations for finite soluble groups and computing (pre-)Frattini subgroups
    • Algorithms for group actions applied to graph generation
    • Partitions, refinements, and permutation group computation
    • A polycyclic quotient algorithm
    • Computing the fitting subgroup and solvable radical of small-base permutation groups in nearly linear time
    • Generalized FFTs–A survey of some recent results
    • The complexity of McKay’s canonical labeling algorithm
    • On nearly linear time algorithms for Sylow subgroups of small-base permutation groups
    • Implementing a recognition algorithm for classical groups
    • Algorithms for polycyclic-by-finite matrix groups
    • Asymptotic results for simple groups and some applications
    • Some applications of generalized FFTs
    • Constructing permutation representations for matrix groups in parallel environments
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
Volume: 281997; 382 pp
MSC: Primary 20

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, ©1993, 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. Comments 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.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

Readership

Graduate students and research mathematicians interested in computational methods.

  • Chapters
  • Randomization in group algorithms: Conceptual questions
  • Experimenting and computing with infinite groups
  • Towards polynomial time algorithms for matrix groups
  • Calculating the order of an invertible matrix
  • A non-constructive recognition algorithm for the special linear and other classical groups
  • GAP/MPI: Facilitating parallelism
  • Constructive recognition of a black box group isomorphic to $GL(n,2)$
  • Special presentations for finite soluble groups and computing (pre-)Frattini subgroups
  • Algorithms for group actions applied to graph generation
  • Partitions, refinements, and permutation group computation
  • A polycyclic quotient algorithm
  • Computing the fitting subgroup and solvable radical of small-base permutation groups in nearly linear time
  • Generalized FFTs–A survey of some recent results
  • The complexity of McKay’s canonical labeling algorithm
  • On nearly linear time algorithms for Sylow subgroups of small-base permutation groups
  • Implementing a recognition algorithm for classical groups
  • Algorithms for polycyclic-by-finite matrix groups
  • Asymptotic results for simple groups and some applications
  • Some applications of generalized FFTs
  • Constructing permutation representations for matrix groups in parallel environments
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.