Computing chief series, composition series and socles in large permutation groups
UNSPECIFIED (1997) Computing chief series, composition series and socles in large permutation groups. In: 1st MAGMA Conference on Computational Algebra and Number Theory, JUL 23-27, 1993, QUEEN MARY AND WESTFIELD COLLEGE, LONDON, ENGLAND.Full text not available from this repository.
We describe the theory and implementation of practical algorithms for computing chief and composition series and socles in large permutation groups. The theory is valid for permutation degrees up to 10 000 000, and the current implementations in the Magma system are practical up to degrees of 1 000 000 for some examples. Several of the techniques involved are based on ideas of Kantor. (C) 1997 Academic Press Limited.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Q Science > QA Mathematics
|Journal or Publication Title:||JOURNAL OF SYMBOLIC COMPUTATION|
|Publisher:||ACADEMIC PRESS LTD|
|Number of Pages:||17|
|Page Range:||pp. 285-301|
|Title of Event:||1st MAGMA Conference on Computational Algebra and Number Theory|
|Location of Event:||QUEEN MARY AND WESTFIELD COLLEGE, LONDON, ENGLAND|
|Date(s) of Event:||JUL 23-27, 1993|
Actions (login required)