Simple groups in computational group theory

MaRDI QIDQ1126707zbMATH OpenFDO

Authors William M. Kantor

Publication date 6 August 1998

Published in Documenta Mathematica (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/222771, http://www.emis.de/journals/DMJDMV/xvol-icm/02/Kantor.MAN.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

classificationefficient algorithmsfinite simple groupsgroup theoretic algorithms

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Finite simple groups and their classification (20D05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Symbolic computation and algebraic computation (68W30)

Review text

This paper surveys many recent results which use structural properties of finite groups to create efficient algorithms for group theoretic computations. The author discusses applications of the classification of finite simple groups to computational group theory, emphasizing results where it is far from obvious how simple groups are relevant, and focusing on the mathematics behind the algorithms. Several theorems are stated with some discussion of the ideas involved in their proofs as well as connections between the results. Many of the theorems stated have the form ``There exists an algorithm \dots (followed by some type of efficiency statement about the algorithm as well as what it computes), but the author also discusses related nonalgorithmic theorems.

Recommendations

• scientific article; zbMATH DE number 3955194
• scientific article; zbMATH DE number 66617
• Towards effective algorithms for linear groups.
• Estimation problems and randomised group algorithms.

Cited in

(12)

• An algorithm for determining the simplicity of a modular group representation
• Prime power graphs for groups of Lie type
• Algorithms determining finite simple images of finitely presented groups
• Computational group theory.
• Black box exceptional groups of Lie type.
• scientific article; zbMATH DE number 3863452 (Why is no real title available?)
• scientific article; zbMATH DE number 3955194 (Why is no real title available?)
• scientific article; zbMATH DE number 66617 (Why is no real title available?)
• Black box exceptional groups of Lie type. II.
• EFFICIENT SIMPLE GROUPS
• Maximal subgroups of finite simple groups: classifications and applications
• Towards effective algorithms for linear groups.

Describes a project that uses

Uses Software

• Magma

This page was built for publication: Simple groups in computational group theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126707)