Construction of large permutation representations for matrix groups II

Applicable Algebra in Engineering, Communications and Computing

Volumn 11, Issue 6, 2001, Pages 463-488

  Weller, Michael ^a  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

Base and strong generating set; Classification of finite simple groups; Janko's 4 th sporadic group; Matrix groups; Permutation representation; Representation theory

Indexed keywords

ALGORITHMS; CALCULATIONS; SET THEORY; THEOREM PROVING; VECTOR QUANTIZATION;

COOPERMAN-FINKELSTEIN-YORK-TSELMAN ALGORITHM; JANKO SPORADIC GROUP; PERMUTATION REPRESENTATION; REPRESENTATION THEORY;

MATRIX ALGEBRA;

EID: 0034991312     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000100058     Document Type: Article

References (14)

1. Fundamental algorithms for permutation groups
2. 4
3. Constructing permutation representations for large matrix groups
4. An algorithm for the construction of a defining set of relations for a finite group
5. A new existence proof for Ly, the sporadic simple group of R. Lyons
6. 22 as subgroups
7. 4 in GL(1333,11)
8. On an algorithm for finding a base and strong generating set for a group given by generating permutations
9. 4
10. The computer calculation of modular characters (the Meat-Axe)
11. Construction of large permutation representations for matrix groups