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

classificationfinite simple groupsefficient algorithmsgroup theoretic algorithms

Mathematics Subject Classification ID

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

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

(11)

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

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)