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

DOI10.3906/MAT-1506-35MaRDI QIDQ4633207zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithm analysisreduction algorithmmatrix groupextraspecial group

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 5043412
• A polynomial-time reduction algorithm for groups of semilinear or subfield class.
• A Recognition Algorithm for Special Linear Groups
• CONSTRUCTIVE RECOGNITION OF NORMALIZERS OF SMALL EXTRA-SPECIAL MATRIX GROUPS
• scientific article; zbMATH DE number 1370596

Cites work

• scientific article; zbMATH DE number 3939563 (Why is no real title available?)
• scientific article; zbMATH DE number 46357 (Why is no real title available?)
• scientific article; zbMATH DE number 194815 (Why is no real title available?)
• scientific article; zbMATH DE number 5043412 (Why is no real title available?)
• A Recognition Algorithm for Special Linear 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.
• CONSTRUCTIVE RECOGNITION OF NORMALIZERS OF SMALL EXTRA-SPECIAL MATRIX GROUPS
• Computing tensor decompositions of finite matrix groups
• Constructive homomorphisms for classical groups.
• Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.
• Lineare auflösbare Gruppen
• On the maximal subgroups of the finite classical groups
• The computational matrix group project.
• The maximal subgroups of the low-dimensional finite classical groups.
• The soluble length of soluble linear groups
• The solvable length of a solvable linear group
• Towards effective algorithms for linear groups.

Cited in

(1)

• scientific article; zbMATH DE number 5043412 (Why is no real title available?)

Describes a project that uses

Uses Software

• recog
• GAP

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)