Computing the table of marks of a cyclic extension
View/ Open
Full Text
Date
2012-01-01Author
Naughton, L.
Pfeiffer, G.
Metadata
Show full item recordUsage
This item's downloads: 0 (view details)
Cited 4 times in Scopus (view citations)
Recommended Citation
Naughton, L. Pfeiffer, G. (2012). Computing the table of marks of a cyclic extension. Mathematics of Computation 81 (280), 2419-2438
Published Version
Abstract
The subgroup pattern of a finite group C is the table of marks of G together with a list of representatives of the conjugacy classes of subgroups of G. In this article we present an algorithm for the computation of the subgroup pattern of a cyclic extension of G from the subgroup pattern of G. Repeated application of this algorithm yields an algorithm for the computation of the table of marks of a solvable group G, along a composition series of G.