The Library
Computing maximal subgroups of finite groups
Tools
UNSPECIFIED (2004) Computing maximal subgroups of finite groups. JOURNAL OF SYMBOLIC COMPUTATION, 37 (5). pp. 589-609. doi:10.1016/j.jsc.2003.08.002 ISSN 0747-7171.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.jsc.2003.08.002
Abstract
We describe a practical algorithm for computing representatives of the conjugacy classes of maximal subgroups in a finite group, together with details of its implementation for permutation groups in the MAGMA system. We also describe methods for computing complements of normal subgroups and minimal supplements of normal soluble subgroups of finite groups. (C) 2003 Elsevier Ltd. All rights reserved.
Item Type: | Journal Article | ||||
---|---|---|---|---|---|
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 ELSEVIER SCIENCE LTD | ||||
ISSN: | 0747-7171 | ||||
Official Date: | May 2004 | ||||
Dates: |
|
||||
Volume: | 37 | ||||
Number: | 5 | ||||
Number of Pages: | 21 | ||||
Page Range: | pp. 589-609 | ||||
DOI: | 10.1016/j.jsc.2003.08.002 | ||||
Publication Status: | Published |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |