A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup

DOI10.3906/mat-1506-35zbMath1424.20047MaRDI QIDQ4633207

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

zbMATH Keywords

matrix group; reduction algorithm; algorithm analysis; extraspecial group

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68W30: Symbolic computation and algebraic computation

20G40: Linear algebraic groups over finite fields

20-04: Software, source code, etc. for problems pertaining to group theory

20H20: Other matrix groups over fields

Uses Software

• GAP
• recog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructive homomorphisms for classical groups.
• A polynomial-time reduction algorithm for groups of semilinear or subfield class.
• Lineare auflösbare Gruppen
• On the maximal subgroups of the finite classical groups
• The solvable length of a solvable linear group
• The soluble length of soluble linear groups
• Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
• The Maximal Subgroups of the Low-Dimensional Finite Classical Groups
• A data structure for a uniform approach to computations with finite groups
• A Recognition Algorithm for Special Linear Groups
• CONSTRUCTIVE RECOGNITION OF NORMALIZERS OF SMALL EXTRA-SPECIAL MATRIX GROUPS