A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup
DOI10.3906/MAT-1506-35zbMATH Open1424.20047OpenAlexW2429213056MaRDI QIDQ4633207FDOQ4633207
Authors: Abdullah Çağman, Nurullah Ankaralioglu 
Publication date: 2 May 2019
Published in: Turkish Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3906/mat-1506-35
Recommendations
Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40) Linear algebraic groups over finite fields (20G40) Software, source code, etc. for problems pertaining to group theory (20-04) Other matrix groups over fields (20H20)
Cites Work
- The maximal subgroups of the low-dimensional finite classical groups.
- Title not available (Why is that?)
- On the maximal subgroups of the finite classical groups
- Title not available (Why is that?)
- Title not available (Why is that?)
- The soluble length of soluble linear groups
- The computational matrix group project.
- A Recognition Algorithm for Special Linear Groups
- Constructive homomorphisms for classical groups.
- Lineare auflösbare Gruppen
- A data structure for a uniform approach to computations with finite groups
- CONSTRUCTIVE RECOGNITION OF NORMALIZERS OF SMALL EXTRA-SPECIAL MATRIX GROUPS
- Title not available (Why is that?)
- Towards effective algorithms for linear groups.
- A polynomial-time reduction algorithm for groups of semilinear or subfield class.
- The solvable length of a solvable linear group
- Computing tensor decompositions of finite matrix groups
- Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
Cited In (1)
Uses Software
This page was built for publication: A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633207)
