A practical model for computation with matrix groups.
From MaRDI portal
Publication:480641
DOI10.1016/j.jsc.2014.08.006zbMath1317.20002OpenAlexW2022781054MaRDI QIDQ480641
Henrik Bäärnhielm, E. A. O'Brien, Derek F. Holt, Charles R. Leedham-Green
Publication date: 9 December 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2014.08.006
presentationscomposition seriesefficient algorithmslinear groups over finite fieldsconstructive recognitioncomposition treesfinite matrix groupsstructural computation
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)
Related Items
Proving infinite index for a subgroup of matrices ⋮ Regular orbits of symmetric and alternating groups ⋮ Gaussian elimination in unitary groups with an application to cryptography ⋮ Groups with a solvable subgroup of prime-power index ⋮ A new method for recognising Suzuki groups ⋮ Lengths of involutions in finite Coxeter groups ⋮ Recognition of absolutely irreducible matrix groups that are tensor decomposable or induced ⋮ Recognising the small Ree groups in their natural representations. ⋮ On soluble subgroups of sporadic groups ⋮ Constructing composition factors for a linear group in polynomial time ⋮ Regular orbits of sporadic simple groups ⋮ Effective black-box constructive recognition of classical groups. ⋮ Automorphism group orbits on finite simple groups ⋮ The use of permutation representations in structural computations in large finite matrix groups ⋮ Presentations on standard generators for classical groups ⋮ Orbit Computation for Atomically Generated Subgroups of Isometries of $\mathbb{Z}^n$ ⋮ Unnamed Item ⋮ Linear groups and computation ⋮ A note on involution centralizers in black box groups
Uses Software
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognising the small Ree groups in their natural representations.
- Constructive homomorphisms for classical groups.
- A polynomial-time reduction algorithm for groups of semilinear or subfield class.
- Large element orders and the characteristic of Lie-type simple groups.
- Constructive recognition of classical groups in odd characteristic.
- Construction of defining relators for finite groups
- Algorithms for the Tits alternative and related problems.
- On the maximal subgroups of the finite classical groups
- Fast constructive recognition of black box symplectic groups.
- Short presentations for finite groups
- The Magma algebra system. I: The user language
- An improved method for generating the centralizer of an involution
- Testing matrix groups for primitivity
- Computing matrix group decompositions with respect to a normal subgroup
- Chains of subgroups in symmetric groups
- Recognising tensor-induced matrix groups.
- The expected number of random elements to generate a finite group.
- Standard generators for sporadic simple groups
- Recognizing finite matrix groups over infinite fields.
- Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
- Constructive recognition of classical groups in even characteristic.
- Fast recognition of alternating groups of unknown degree.
- Minimal and random generation of permutation and matrix groups.
- Computing conjugacy classes of elements in matrix groups.
- Constructive Sylow theorems for the classical groups.
- Constructive recognition of \(\text{SL}_3(q)\).
- Recognising the Suzuki groups in their natural representations.
- Fast constructive recognition of black box orthogonal groups.
- Writing projective representations over subfields.
- Black box classical groups
- Recognition of finite exceptional groups of Lie type
- Black box exceptional groups of Lie type
- A data structure for a uniform approach to computations with finite groups
- Short presentations for alternating and symmetric groups
- Computing a Chief Series and the Soluble Radical of a Matrix Group Over a Finite Field
- Computing Minimal Polynomials of Matrices
- A Reduction Algorithm for Large-Base Primitive Permutation Groups
- Constructive membership in black-box groups
- Presentations of finite simple groups: A quantitative approach
- Chains of Subgroups in Groups of Lie Type III
- A Recognition Algorithm For Classical Groups Over Finite Fields
- Recognising Tensor Products of Matrix Groups
- Treating the Exceptional Cases of the MeatAxe
- Black-box recognition of finite simple groups of Lie type by statistics of element orders
- Computing in groups of Lie type
- Fast Constructive Recognition of Black-Box Unitary Groups
- Generating random elements of a finite group
- Polynomial-time theory of matrix groups
- ESTIMATION AND COMPUTATION WITH MATRICES OVER FINITE FIELDS
- Generating Finite Completely Reducible Linear Groups
- Finding the characteristic of a group of Lie type
- RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS
- CONSTRUCTIVE RECOGNITION OF NORMALIZERS OF SMALL EXTRA-SPECIAL MATRIX GROUPS
- Constructive recognition of 𝑃𝑆𝐿(2,𝑞)
- Constructive Membership Testing in Black-Box Classical Groups
- Matrix generators for exceptional groups of Lie type
