# zbMATH — the first resource for mathematics

Computing the table of marks of a cyclic extension. (English) Zbl 1282.20015
Summary: The subgroup pattern of a finite group $$G$$ 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$$.

##### MSC:
 20C40 Computational methods (representations of groups) (MSC2010) 19A22 Frobenius induction, Burnside and representation rings 20B40 Computational methods (permutation groups) (MSC2010) 20D30 Series and lattices of subgroups 20D10 Finite solvable groups, theory of formations, Schunck classes, Fitting classes, $$\pi$$-length, ranks
GAP; TomLib
Full Text:
##### References:
 [1] Serge Bouc, Burnside rings, Handbook of algebra, Vol. 2, Handb. Algebr., vol. 2, Elsevier/North-Holland, Amsterdam, 2000, pp. 739 – 804. · Zbl 0969.19001 · doi:10.1016/S1570-7954(00)80043-1 · doi.org [2] Thomas Breuer and Götz Pfeiffer, Finding possible permutation characters, J. Symbolic Comput. 26 (1998), no. 3, 343 – 354. · Zbl 0921.20013 · doi:10.1006/jsco.1998.0217 · doi.org [3] Francis Buekenhout, Diagrams for geometries and groups, J. Combin. Theory Ser. A 27 (1979), no. 2, 121 – 151. · Zbl 0419.51003 · doi:10.1016/0097-3165(79)90041-4 · doi.org [4] Francis Buekenhout and Sarah Rees, The subgroup structure of the Mathieu group \?$$_{1}$$$$_{2}$$, Math. Comp. 50 (1988), no. 182, 595 – 605. · Zbl 0646.20018 [5] W. Burnside, Theory of groups of finite order, Dover Publications, Inc., New York, 1955. 2d ed. · Zbl 0064.25105 [6] John J. Cannon, Bruce C. Cox, and Derek F. Holt, Computing the subgroups of a permutation group, J. Symbolic Comput. 31 (2001), no. 1-2, 149 – 161. Computational algebra and number theory (Milwaukee, WI, 1996). · Zbl 0984.20002 · doi:10.1006/jsco.2000.1012 · doi.org [7] Andreas Dress, A characterisation of solvable groups, Math. Z. 110 (1969), 213 – 217. · Zbl 0174.30806 · doi:10.1007/BF01110213 · doi.org [8] The GAP Group, GAP - Groups, Algorithms, and Programming, Version 4.4.12, 2008, http://www.gap-system.org. [9] Derek F. Holt, Enumerating subgroups of the symmetric group, Computational group theory and the theory of groups, II, Contemp. Math., vol. 511, Amer. Math. Soc., Providence, RI, 2010, pp. 33 – 37. · Zbl 1198.20003 · doi:10.1090/conm/511/10041 · doi.org [10] Alexander Hulpke, Computing subgroups invariant under a set of automorphisms, J. Symbolic Comput. 27 (1999), no. 4, 415 – 427. · Zbl 0943.20019 · doi:10.1006/jsco.1998.0260 · doi.org [11] Liam Naughton, Computing the table of marks of a finite group, Ph.D. thesis, National University of Ireland, Galway, 2010. [12] J. Neubüser, Untersuchungen des Untergruppenverbandes endlicher Gruppen auf einer programmgesteuerten electronischen Dualmaschine, Numer. Math. 2 (1960), 280 – 292 (German). · Zbl 0101.01802 · doi:10.1007/BF01386229 · doi.org [13] Peter M. Neumann, A lemma that is not Burnside’s, Math. Sci. 4 (1979), no. 2, 133 – 141. · Zbl 0409.20001 [14] Götz Pfeiffer, The subgroups of \?$$_{2}$$$$_{4}$$, or how to compute the table of marks of a finite group, Experiment. Math. 6 (1997), no. 3, 247 – 270. · Zbl 0895.20017 [15] Tomlib, Version 1.2.1, GAP package, 2011, http://schmidt.nuigalway.ie/tomlib.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.