Computing the table of marks of a cyclic extension

dc.contributor.author	Naughton, L.
dc.contributor.author	Pfeiffer, G.
dc.date.accessioned	2018-09-20T16:19:04Z
dc.date.available	2018-09-20T16:19:04Z
dc.date.issued	2012-01-01
dc.identifier.citation	Naughton, L. Pfeiffer, G. (2012). Computing the table of marks of a cyclic extension. Mathematics of Computation 81 (280), 2419-2438
dc.identifier.issn	0025-5718,1088-6842
dc.identifier.uri	http://hdl.handle.net/10379/13088
dc.description.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.
dc.publisher	American Mathematical Society (AMS)
dc.relation.ispartof	Mathematics of Computation
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Ireland
dc.rights.uri	https://creativecommons.org/licenses/by-nc-nd/3.0/ie/
dc.subject	subgroups
dc.title	Computing the table of marks of a cyclic extension
dc.type	Article
dc.identifier.doi	10.1090/s0025-5718-2012-02600-7
dc.local.publishedsource	http://arxiv.org/pdf/1105.4064
nui.item.downloads	0

Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Ireland