Computing Sylow subgroups in permutation groups
UNSPECIFIED (1997) Computing Sylow subgroups in 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 a practical algorithm for computing a Sylow subgroup of a permutation group and for finding an element that conjugates one Sylow subgroup to another. The performance of the current implementations in the Magma system represents a significant improvement on previous implementations for many important classes of examples and generally extends the range of realistic applicability to groups of much larger degrees than before. (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:||14|
|Page Range:||pp. 303-316|
|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)