Computing the table of marks of a cyclic extension
HTML articles powered by AMS MathViewer
- by L. Naughton and G. Pfeiffer PDF
- Math. Comp. 81 (2012), 2419-2438 Request permission
Abstract:
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$.References
- Serge Bouc, Burnside rings, Handbook of algebra, Vol. 2, Handb. Algebr., vol. 2, Elsevier/North-Holland, Amsterdam, 2000, pp. 739–804. MR 1759611, DOI 10.1016/S1570-7954(00)80043-1
- Thomas Breuer and Götz Pfeiffer, Finding possible permutation characters, J. Symbolic Comput. 26 (1998), no. 3, 343–354. MR 1633876, DOI 10.1006/jsco.1998.0217
- Francis Buekenhout, Diagrams for geometries and groups, J. Combin. Theory Ser. A 27 (1979), no. 2, 121–151. MR 542524, DOI 10.1016/0097-3165(79)90041-4
- Francis Buekenhout and Sarah Rees, The subgroup structure of the Mathieu group $M_{12}$, Math. Comp. 50 (1988), no. 182, 595–605. MR 929556, DOI 10.1090/S0025-5718-1988-0929556-X
- W. Burnside, Theory of groups of finite order, Dover Publications, Inc., New York, 1955. 2d ed. MR 0069818
- 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). MR 1806212, DOI 10.1006/jsco.2000.1012
- Andreas Dress, A characterisation of solvable groups, Math. Z. 110 (1969), 213–217. MR 248239, DOI 10.1007/BF01110213
- The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.4.12, 2008, http://www.gap-system.org.
- 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. MR 2655292, DOI 10.1090/conm/511/10041
- Alexander Hulpke, Computing subgroups invariant under a set of automorphisms, J. Symbolic Comput. 27 (1999), no. 4, 415–427. MR 1681348, DOI 10.1006/jsco.1998.0260
- Liam Naughton, Computing the table of marks of a finite group, Ph.D. thesis, National University of Ireland, Galway, 2010.
- J. Neubüser, Untersuchungen des Untergruppenverbandes endlicher Gruppen auf einer programmgesteuerten electronischen Dualmaschine, Numer. Math. 2 (1960), 280–292 (German). MR 117939, DOI 10.1007/BF01386229
- Peter M. Neumann, A lemma that is not Burnside’s, Math. Sci. 4 (1979), no. 2, 133–141. MR 562002
- Götz Pfeiffer, The subgroups of $M_{24}$, or how to compute the table of marks of a finite group, Experiment. Math. 6 (1997), no. 3, 247–270. MR 1481593, DOI 10.1080/10586458.1997.10504613
- Tomlib, Version 1.2.1, GAP package, 2011, http://schmidt.nuigalway.ie/tomlib.
Additional Information
- L. Naughton
- Affiliation: School of Mathematics, Statistics and Applied Mathematics, NUI, Galway
- Email: liam.naughton@nuigalway.ie
- G. Pfeiffer
- Affiliation: School of Mathematics, Statistics and Applied Mathematics, NUI, Galway
- Email: goetz.pfeiffer@nuigalway.ie
- Received by editor(s): May 20, 2011
- Received by editor(s) in revised form: July 27, 2011
- Published electronically: February 24, 2012
- © Copyright 2012
American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication. - Journal: Math. Comp. 81 (2012), 2419-2438
- MSC (2010): Primary 20B40; Secondary 19A22, 20D30, 20D08, 20D10
- DOI: https://doi.org/10.1090/S0025-5718-2012-02600-7
- MathSciNet review: 2945164