Computing the table of marks of a cyclic extension
View/ Open
Date
2012-02-24Author
Naughton, L.
Pfeiffer, Götz
Metadata
Show full item recordUsage
This item's downloads: 1033 (view details)
Cited 4 times in Scopus (view citations)
Recommended Citation
Naughton, L., & Pfeiffer, Götz. (2012). Computing the table of marks of a cyclic extension. Mathematics Of Computation, 81, 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.