Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.

DOI10.1016/j.jalgebra.2005.01.035zbMath1107.20012OpenAlexW2030681296WikidataQ56987842 ScholiaQ56987842MaRDI QIDQ2577534

Robert Beals, Cheryl E. Praeger, Alice C. Niemeyer, Charles R. Leedham-Green, Seress, Ákos

Publication date: 22 December 2005

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2005.01.035

zbMATH Keywords

symmetric groupsalternating groupsmatrix groupsprobabilistic methodsconstructive recognitionLas Vegas algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Linear algebraic groups over finite fields (20G40) Probabilistic methods in group theory (20P05)

Related Items (5)

FINDING INVOLUTIONS WITH SMALL SUPPORT ⋮ RECOGNITION OF SMALL DIMENSIONAL REPRESENTATIONS OF GENERAL LINEAR GROUPS ⋮ On the twisted modules for finite matrix groups ⋮ A contribution to the analysis of a reduction algorithm for groups with an extraspecial normal subgroup ⋮ Random generation of finite simple groups by \(p\)-regular or \(p\)-singular elements

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximal subgroups of the finite classical groups
• Matrix multiplication via arithmetic progressions
• The faithful linear representations of least degree of \(S_n\) and \(A_n\) over a field of characteristic 2.
• The faithful linear representations of least degree of \(S_n\) and \(A_n\) over a field of odd characteristic
• An observation on the degrees of projective representations of the symmetric and alternating group over an arbitrary field
• Fast Monte Carlo algorithms for permutation groups
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• Approximate formulas for some functions of prime numbers
• On the minimal dimensions of irreducible representations of symmetric groups
• On the Orders of Maximal Subgroups of the Finite Classical Groups
• A generalization of the fast LUP matrix decomposition algorithm and applications
• Subquadratic-time factoring of polynomials over finite fields
• A black-box group algorithm for recognizing finite symmetric and alternating groups, I
• Permutations with Restricted Cycle Structure and an Algorithmic Application
• Generating random elements of a finite group

This page was built for publication: Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules.