scientific article
From MaRDI portal
Publication:2759632
zbMath1052.20034MaRDI QIDQ2759632
Publication date: 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
presentationsrandom elementscomposition seriesefficient algorithmslinear groups over finite fieldsconstructive recognitionrandomised algorithms
Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Simple groups: alternating groups and groups of Lie type (20D06) Randomized algorithms (68W20) Probabilistic methods in group theory (20P05)
Related Items (31)
Computing in groups of Lie type ⋮ Computer construction of split Cartan subalgebras ⋮ Identification of matrix generators of a Chevalley group. ⋮ Recognition of absolutely irreducible matrix groups that are tensor decomposable or induced ⋮ Recognising the small Ree groups in their natural representations. ⋮ Presentations of finite simple groups: a computational approach. ⋮ On a variant of the product replacement algorithm ⋮ Constructive homomorphisms for classical groups. ⋮ Fast recognition of alternating groups of unknown degree. ⋮ Minimal and random generation of permutation and matrix groups. ⋮ Constructive recognition of classical groups in their natural representation. ⋮ The product replacement prospector. ⋮ Black box exceptional groups of Lie type. II. ⋮ A practical model for computation with matrix groups. ⋮ A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup ⋮ Constructive recognition of 𝑃𝑆𝐿(2,𝑞) ⋮ Computing finite semigroups ⋮ Presentations of finite simple groups: A quantitative approach ⋮ THE ANDREWS–CURTIS CONJECTURE AND BLACK BOX GROUPS ⋮ Recognising the Suzuki groups in their natural representations. ⋮ A computer-assisted analysis of some matrix groups. ⋮ Representations, commutative algebra, and Hurwitz groups. ⋮ Fast constructive recognition of black box orthogonal groups. ⋮ A polynomial-time reduction algorithm for groups of semilinear or subfield class. ⋮ Large element orders and the characteristic of Lie-type simple groups. ⋮ Irreducible linear subgroups generated by pairs of matrices with large irreducible submodules. ⋮ The average number of cycles. ⋮ Black box exceptional groups of Lie type ⋮ Writing projective representations over subfields. ⋮ Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules. ⋮ Black-box recognition of finite simple groups of Lie type by statistics of element orders
Uses Software
This page was built for publication:
