Constructing permutation representations for matrix groups

DOI10.1006/jsco.1997.0146zbMath0884.20010OpenAlexW2089438441MaRDI QIDQ1369807

Larry Finkelstein, Gene Cooperman, Bryant York, Michael Tselman

Publication date: 7 January 1998

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/cf03300c2bb7dccdd6280f77cd2d4a4ae7cd94ea

zbMATH Keywords

algorithmspermutation representationsstrong generating setsmatrix groups over finite fieldssporadic simple group \(Ly\)time efficiency

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Representations of finite groups of Lie type (20C33)

Related Items

On the ranks of \(O'N\) and \(Ly\). ⋮ A NEW COMPUTER CONSTRUCTION OF THE IRREDUCIBLE 112-DIMENSIONAL 2-MODULAR REPRESENTATION OF JANKO'S GROUPJ₄ ⋮ A new existence proof for \(Ly\), the sporadic simple group of R. Lyons ⋮ NATURAL EXISTENCE PROOF FOR LYONS SIMPLE GROUP ⋮ On the construction of the finite simple groups with a given centralizer of a 2-central involution

Uses Software

• STAR/MPI