The Library
Computing subgroups of bounded index in a finite group
Tools
Tools
Tools
UNSPECIFIED. (2005) Computing subgroups of bounded index in a finite group. JOURNAL OF SYMBOLIC COMPUTATION, 40 (2). pp. 1013-1022. ISSN 0747-7171
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.jsc.2005.02.002
Abstract
We describe a practical algorithm for computing representatives of the conjugacy classes of subgroups up to a given index in a finite group. This algorithm has been implemented in MAGMA, and we present some performance statistics. (c) 2005 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 |
| Date: | August 2005 |
| Volume: | 40 |
| Number: | 2 |
| Number of Pages: | 10 |
| Page Range: | pp. 1013-1022 |
| Identification Number: | 10.1016/j.jsc.2005.02.002 |
| Publication Status: | Published |
| URI: | http://wrap.warwick.ac.uk/id/eprint/6867 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
