A practical model for computation with matrix groups.

DOI10.1016/J.JSC.2014.08.006zbMATH Open1317.20002OpenAlexW2022781054MaRDI QIDQ480641FDOQ480641

Henrik Bäärnhielm, E. A. O'Brien, Derek F. Holt, C. 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

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.

zbMATH Keywords

composition seriespresentationsefficient algorithmslinear groups over finite fieldsconstructive recognitioncomposition treesfinite matrix groupsstructural computation

Mathematics Subject Classification ID

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)

Cites Work

• The Magma algebra system. I: The user language
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Large element orders and the characteristic of Lie-type simple groups.
• Chains of subgroups in symmetric groups
• Title not available (Why is that?)
• On the maximal subgroups of the finite classical groups
• Algorithms for the Tits alternative and related problems.
• Writing projective representations over subfields.
• Minimal and random generation of permutation and matrix groups.
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• The expected number of random elements to generate a finite group.
• Title not available (Why is that?)
• Generating random elements of a finite group
• Short presentations for finite groups
• Standard generators for sporadic simple groups
• An improved method for generating the centralizer of an involution
• Constructive membership in black-box groups
• Title not available (Why is that?)
• Treating the Exceptional Cases of the MeatAxe
• Recognising the Suzuki groups in their natural representations.
• The computational matrix group project.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recognising the small Ree groups in their natural representations.
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Recognition Algorithm For Classical Groups Over Finite Fields
• Title not available (Why is that?)
• Constructive recognition of 𝑃𝑆𝐿(2,𝑞)
• Constructive homomorphisms for classical groups.
• Constructive recognition of classical groups in odd characteristic.
• Matrix generators for exceptional groups of Lie type
• Presentations of finite simple groups: A quantitative approach
• Recognizing finite matrix groups over infinite fields.
• Constructive recognition of classical groups in even characteristic.
• Computing conjugacy classes of elements in matrix groups.
• Constructive recognition of \(\text{SL}_3(q)\).
• Fast constructive recognition of black box orthogonal groups.
• 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
• Black-box recognition of finite simple groups of Lie type by statistics of element orders
• Fast Constructive Recognition of Black-Box Unitary Groups
• Polynomial-time theory of matrix groups
• ESTIMATION AND COMPUTATION WITH MATRICES OVER FINITE FIELDS
• Finding the characteristic of a group of Lie type
• RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS
• Constructive Membership Testing in Black-Box Classical Groups
• Fast constructive recognition of black box symplectic groups.
• Testing matrix groups for primitivity
• Computing matrix group decompositions with respect to a normal subgroup
• Recognising tensor-induced matrix groups.
• Fast recognition of alternating groups of unknown degree.
• Constructive Sylow theorems for the classical groups.
• Recognizing simplicity of black-box groups and the frequency of \(p\)-singular elements in affine 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
• Chains of Subgroups in Groups of Lie Type III
• Title not available (Why is that?)
• Recognising Tensor Products of Matrix Groups
• Title not available (Why is that?)
• Computing in groups of Lie type
• Generating Finite Completely Reducible Linear Groups
• CONSTRUCTIVE RECOGNITION OF NORMALIZERS OF SMALL EXTRA-SPECIAL MATRIX GROUPS
• Title not available (Why is that?)
• Title not available (Why is that?)
• A polynomial-time reduction algorithm for groups of semilinear or subfield class.
• Construction of defining relators for finite groups

Cited In (26)

• Recognising the small Ree groups in their natural representations.
• Automorphism group orbits on finite simple groups
• Gaussian elimination in unitary groups with an application to cryptography
• Title not available (Why is that?)
• A new method for recognising Suzuki groups
• Orbit Computation for Atomically Generated Subgroups of Isometries of $\mathbb{Z}^n$
• Practical Computation with Linear Groups Over Infinite Domains
• Regular orbits of symmetric and alternating groups
• Calculating subgroups with GAP
• On soluble subgroups of sporadic groups
• Proving infinite index for a subgroup of matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Effective black-box constructive recognition of classical groups.
• Groups with a solvable subgroup of prime-power index
• The computational matrix group project.
• Linear groups and computation
• Recognition of absolutely irreducible matrix groups that are tensor decomposable or induced
• The use of permutation representations in structural computations in large finite matrix groups
• Constructing composition factors for a linear group in polynomial time
• Lengths of involutions in finite Coxeter groups
• A note on involution centralizers in black box groups
• Presentations on standard generators for classical groups
• Regular orbits of sporadic simple groups
• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• GAP
• Magma
• MeatAxe
• recog
• ATLAS Group Representations

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)