A practical model for computation with matrix groups.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1981751
- Complexity and computation in matrix groups.
- Computing in Nilpotent Matrix Groups
- Computing with matrix groups over infinite fields.
- A unified approach to computations with permutation and matrix groups.
- scientific article; zbMATH DE number 475364
- scientific article; zbMATH DE number 1256646
- scientific article; zbMATH DE number 5976624
- A computer-assisted analysis of some matrix groups.
Cites work
- scientific article; zbMATH DE number 5976624 (Why is no real title available?)
- scientific article; zbMATH DE number 3884354 (Why is no real title available?)
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 1187240 (Why is no real title available?)
- scientific article; zbMATH DE number 46357 (Why is no real title available?)
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- scientific article; zbMATH DE number 194089 (Why is no real title available?)
- scientific article; zbMATH DE number 1284153 (Why is no real title available?)
- scientific article; zbMATH DE number 475356 (Why is no real title available?)
- scientific article; zbMATH DE number 682071 (Why is no real title available?)
- scientific article; zbMATH DE number 1004929 (Why is no real title available?)
- scientific article; zbMATH DE number 2133330 (Why is no real title available?)
- scientific article; zbMATH DE number 1361739 (Why is no real title available?)
- scientific article; zbMATH DE number 1370596 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- scientific article; zbMATH DE number 5043412 (Why is no real title available?)
- A Recognition Algorithm For Classical Groups Over Finite Fields
- A Reduction Algorithm for Large-Base Primitive Permutation Groups
- A data structure for a uniform approach to computations with finite groups
- A polynomial-time reduction algorithm for groups of semilinear or subfield class.
- Algorithms for the Tits alternative and related problems.
- An improved method for generating the centralizer of an involution
- Black box classical groups.
- Black box exceptional groups of Lie type.
- Black-box recognition of finite simple groups of Lie type by statistics of element orders
- CONSTRUCTIVE RECOGNITION OF NORMALIZERS OF SMALL EXTRA-SPECIAL MATRIX GROUPS
- Chains of Subgroups in Groups of Lie Type III
- Chains of subgroups in symmetric groups
- Computing a chief series and the soluble radical of a matrix group over a finite field.
- Computing conjugacy classes of elements in matrix groups.
- Computing in groups of Lie type
- Computing matrix group decompositions with respect to a normal subgroup
- Computing minimal polynomials of matrices
- Construction of defining relators for finite groups
- Constructive Sylow theorems for the classical groups.
- Constructive homomorphisms for classical groups.
- Constructive membership in black-box groups
- Constructive membership testing in black-box classical groups.
- Constructive recognition of \(\text{SL}_3(q)\).
- Constructive recognition of classical groups in even characteristic.
- Constructive recognition of classical groups in odd characteristic.
- Constructive recognition of 𝑃𝑆𝐿(2,𝑞)
- ESTIMATION AND COMPUTATION WITH MATRICES OVER FINITE FIELDS
- Fast Constructive Recognition of Black-Box Unitary Groups
- Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
- Fast constructive recognition of black box orthogonal groups.
- Fast constructive recognition of black box symplectic groups.
- Fast recognition of alternating groups of unknown degree.
- Finding the characteristic of a group of Lie type
- Generating Finite Completely Reducible Linear Groups
- Generating random elements of a finite group
- Large element orders and the characteristic of Lie-type simple groups.
- Matrix generators for exceptional groups of Lie type
- Minimal and random generation of permutation and matrix groups.
- On the maximal subgroups of the finite classical groups
- Polynomial-time theory of matrix groups
- Presentations of finite simple groups: a quantitative approach.
- RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS
- Recognising Tensor Products of Matrix Groups
- Recognising tensor-induced matrix groups.
- Recognising the Suzuki groups in their natural representations.
- Recognising the small Ree groups in their natural representations.
- Recognition of finite exceptional groups of Lie type.
- Recognizing finite matrix groups over infinite fields.
- Recognizing simplicity of black-box groups and the frequency of \(p\)-singular elements in affine groups.
- Short presentations for alternating and symmetric groups
- Short presentations for finite groups
- Standard generators for sporadic simple groups
- Testing matrix groups for primitivity
- The Magma algebra system. I: The user language
- The computational matrix group project.
- The expected number of random elements to generate a finite group.
- Towards effective algorithms for linear groups.
- Treating the Exceptional Cases of the MeatAxe
- Writing projective representations over subfields.
Cited in
(33)- The use of permutation representations in structural computations in large finite matrix groups
- scientific article; zbMATH DE number 7196252 (Why is no real title available?)
- A note on involution centralizers in black box groups
- Effective black-box constructive recognition of classical groups.
- Computing conjugacy classes of elements in matrix groups.
- Practical Computation with Linear Groups Over Infinite Domains
- Groups with a solvable subgroup of prime-power index
- Constructing all composition series of a finite group.
- A computer-assisted analysis of some matrix groups.
- On soluble subgroups of sporadic groups
- Recognising the small Ree groups in their natural representations.
- A new method for recognising Suzuki groups
- Computing a chief series and the soluble radical of a matrix group over a finite field.
- Presentations on standard generators for classical groups
- Gaussian elimination in split unitary groups with an application to public-key cryptography
- Computing in Nilpotent Matrix Groups
- Constructing composition factors for a linear group in polynomial time
- Calculating subgroups with GAP
- Identification of matrix generators of a Chevalley group.
- Regular orbits of sporadic simple groups
- Proving infinite index for a subgroup of matrices
- How programming was used to determine factorizations of self-similar groups associated to the first Grigorchuk group
- scientific article; zbMATH DE number 1302483 (Why is no real title available?)
- Orbit Computation for Atomically Generated Subgroups of Isometries of $\mathbb{Z}^n$
- Linear groups and computation
- Lengths of involutions in finite Coxeter groups
- scientific article; zbMATH DE number 5976624 (Why is no real title available?)
- Recognition of absolutely irreducible matrix groups that are tensor decomposable or induced
- scientific article; zbMATH DE number 475364 (Why is no real title available?)
- scientific article; zbMATH DE number 1981751 (Why is no real title available?)
- Regular orbits of symmetric and alternating groups
- Automorphism group orbits on finite simple groups
- The computational matrix group project.
This page was built for publication: A practical model for computation with matrix groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q480641)
