Black box exceptional groups of Lie type

DOI10.1090/S0002-9947-2013-05822-9zbMath1285.20012arXiv1112.3000OpenAlexW2096421746WikidataQ115285434 ScholiaQ115285434MaRDI QIDQ2847127

Kay Magaard, William M. Kantor

Publication date: 4 September 2013

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

Full work available at URL: https://arxiv.org/abs/1112.3000

zbMATH Keywords

exceptional groups of Lie typefinite linear groupsconstructive recognitionLas Vegas algorithmsblack box groupsexceptional simple groups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Software, source code, etc. for problems pertaining to group theory (20-04) Simple groups: alternating groups and groups of Lie type (20D06) Probabilistic methods in group theory (20P05)

Related Items

Minimum Circuit Size, Graph Isomorphism, and Related Problems, Prime power graphs for groups of Lie type, Black box exceptional groups of Lie type. II., A practical model for computation with matrix groups., Constructive recognition of \(\text{SL}_3(q)\)., Recognition of finite exceptional groups of Lie type

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recognising simplicity of black-box groups by constructing involutions and their centralisers.
• Presentations of finite simple groups: a computational approach.
• An algorithm for Lang's theorem.
• Computing Chevalley bases in small characteristics
• Large element orders and the characteristic of Lie-type simple groups.
• Fast constructive recognition of black box symplectic groups.
• Generating random elements in finite groups.
• Primitive permutation groups of odd degree, and an application to finite projective planes
• The maximal subgroups of the Steinberg triality groups \(3D_ 4(q)\) and their automorphism groups
• The maximal subgroups of the Chevalley groups \(G_ 2(q)\) with q odd, the Ree groups \(2G_ 2(q)\), and their automorphism groups
• Simple groups in computational group theory
• The geometry of root subgroups in exceptional groups. I
• Generators, relations and coverings of algebraic groups. II
• Subgroups generated by root elements in groups of Lie type
• Prime power graphs for groups of Lie type
• Short presentations for finite groups
• Constructive recognition of classical groups in their natural representation.
• An improved method for generating the centralizer of an involution
• Constructive recognition of \(\text{SL}_3(q)\).
• Recognising the Suzuki groups in their natural representations.
• Fast constructive recognition of black box orthogonal groups.
• Black box classical groups
• Constructive membership in black-box groups
• Presentations of finite simple groups: A quantitative approach
• The Maximal Tori in The Finite Chevalley Groups of Type E₆E₇And E₈
• Subgroups of Maximal Rank in Finite Exceptional Groups of Lie Type
• A Recognition Algorithm for Special Linear Groups
• The 2-Transitive Permutation Representations of the Finite Chevalley Groups
• Subgroups of Classical Groups Generated by Long Root Elements
• The semisimple conjugacy classes and the generic class number of the finite simple groups of lie type E₈
• Linear Groups with Orders Having Certain Large Prime Divisors
• Black-box recognition of finite simple groups of Lie type by statistics of element orders
• A black-box group algorithm for recognizing finite symmetric and alternating groups, I
• Computing in groups of Lie type
• Fast Constructive Recognition of Black-Box Unitary Groups
• Generating random elements of a finite group
• Finding the characteristic of a group of Lie type
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞)