Black box exceptional groups of Lie type. II.

DOI10.1016/j.jalgebra.2014.09.003zbMath1304.20020WikidataQ115350901 ScholiaQ115350901MaRDI QIDQ468723

Kay Magaard, William M. Kantor

Publication date: 7 November 2014

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2014.09.003

zbMATH Keywords

exceptional groups of Lie type; finite linear groups; constructive recognition; Las Vegas algorithms; black box groups; exceptional simple groups

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W30: Symbolic computation and algebraic computation

20G40: Linear algebraic groups over finite fields

20-04: Software, source code, etc. for problems pertaining to group theory

20D06: Simple groups: alternating groups and groups of Lie type

20P05: Probabilistic methods in group theory

20G41: Exceptional groups

Related Items

A black-box group algorithm for recognizing finite symmetric and alternating groups, I, Large element orders and the characteristic of Lie-type simple groups., Constructing composition factors for a linear group in polynomial time, A note on involution centralizers in black box groups, Minimum Circuit Size, Graph Isomorphism, and Related Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Black box groups isomorphic to \(\mathrm{PGL}(2,2^e)\).
• Recognising simplicity of black-box groups by constructing involutions and their centralisers.
• Small-diameter Cayley graphs for finite simple groups
• Fast constructive recognition of black box symplectic groups.
• Generating random elements in finite groups.
• Simple groups in computational group theory
• Short presentations for finite groups
• Constructive recognition of classical groups in their natural representation.
• An improved method for generating the centralizer of an involution
• Fast Monte Carlo algorithms for permutation groups
• On the probability that a group element is \(p\)-singular
• The probability of generating a finite simple group
• Constructive recognition of \(\text{SL}_3(q)\).
• Fast constructive recognition of black box orthogonal groups.
• The probability of generating a finite classical group
• Black box classical groups
• Low-Dimensional Representations of Quasi-Simple Groups
• Recognition of finite exceptional groups of Lie type
• Black box exceptional groups of Lie type
• MAXIMAL SUBGROUPS OF LARGE RANK IN EXCEPTIONAL GROUPS OF LIE TYPE
• Black-box recognition of finite simple groups of Lie type by statistics of element orders
• Small Degree Representations of Finite Chevalley Groups in Defining Characteristic
• Corrigenda: Low-dimensional Representations of Quasi-simple Groups
• Fast Constructive Recognition of Black-Box Unitary Groups
• Polynomial-time theory of matrix groups
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞)