Black box classical groups.

DOI10.1090/MEMO/0708MaRDI QIDQ2704686zbMATH OpenOpenAlexFDO

Authors Ákos Seress, William M. Kantor

Publication date 9 July 2002

Published in Memoirs of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/memo/0708

zbMATH Keywords

black box groupsclassical groupsLas Vegas algorithmsMonte Carlo permutation group algorithmsnearly linear time algorithms

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Linear algebraic groups over finite fields (20G40) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Symbolic computation and algebraic computation (68W30)

Recommendations

• Black box exceptional groups of Lie type.
• Black box groups.
• Effective black-box constructive recognition of classical groups.
• Black box exceptional groups of Lie type. II.
• Fast recognition of alternating groups of unknown degree.

Cited in

(39)

• Prime power graphs for groups of Lie type
• Constructive recognition of classical groups in their natural representation.
• Adjoint representations of black box groups \(\operatorname{PSL}_2(\mathbb{F}_q)\)
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• Presentations on standard generators for classical groups
• Constructive recognition of classical groups in even characteristic.
• Constructive recognition of \(\text{SL}_3(q)\).
• Fast constructive recognition of black box orthogonal groups.
• Computing maximal subgroups of finite groups.
• Recognition of finite exceptional groups of Lie type.
• Black box exceptional groups of Lie type.
• New approaches in black box group theory.
• Finite groups and complexity theory: from Leningrad to Saint Petersburg via Las Vegas
• Constructive membership in black-box groups
• Presentations of finite simple groups: a quantitative approach.
• Certain classical groups are not well-defined
• scientific article; zbMATH DE number 1004932 (Why is no real title available?)
• On the twisted modules for finite matrix groups
• Black box groups isomorphic to \(\mathrm{PGL}(2,2^e)\).
• Effective black-box constructive recognition of classical groups.
• Black box exceptional groups of Lie type. II.
• A black-box group algorithm for recognizing finite symmetric and alternating groups, I
• A practical model for computation with matrix groups.
• Computing in groups of Lie type
• Gaussian elimination in split unitary groups with an application to public-key cryptography
• Black box groups.
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞)
• Constructive membership testing in black-box classical groups.
• Short presentations for three-dimensional unitary groups.
• scientific article; zbMATH DE number 7716603 (Why is no real title available?)
• Applications of finite non-abelian simple groups to cryptography in the quantum era
• Showcasing straight-line programs with memory via matrix Bruhat decomposition
• The minimal faithful permutation degree of groups without abelian normal subgroups
• Complexity of minimal faithful permutation degree for fitting-free groups
• Bipartite q-Kneser graphs and two-generated irreducible linear groups
• Finding a cycle base of a permutation group in polynomial time
• Large element orders and the characteristic of Lie-type simple groups.
• Constructive recognition of classical groups in odd characteristic.
• Fast constructive recognition of black box symplectic groups.

This page was built for publication: Black box classical groups.

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