DOCSLIB.ORG

Construction of Finite Matrix Groups

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Construction of Finite Matrix Groups Construction of finite matrix groups Robert A. Wilson School of Mathematics and Statistics, The University of Birmingham published in Birkh¨auserProgress in Math. 173 (1999), pp. 61{83 Abstract We describe various methods of construction of matrix representa- tions of finite groups. The applications are mainly, but not exclusively, to quasisimple or almost simple groups. Some of the techniques can also be generalized to permutation representations. 1 Introduction It is one thing to determine the characters of a group, but quite another to construct the associated representations. For example, it is an elementary exercise to obtain the character table of the alternating group A5 by first determining the conjugacy classes, then writing down the trivial character and the permutation characters on points and unordered pairs, and using row orthogonality to obtain the irreducibles of degree 4 and 5, and finally using column orthogonality to complete the table. The result (see Table 1) shows that there are two characters of degree 3, but how do we construct the corresponding 3-dimensional representations? In general, we need some more information than just the characters, such as a presentation in terms of generators and relations, or some knowledge of subgroup structure, such as a generating amalgam, or something similar. If we have a presentation for our group, then in a sense it is already de- termined, and there are various algorithms which in principle at least will construct more or less any desired representation. The most important and 1 Table 1: The character table of A5 Class name 1A 2A 3A 5A 5B Class size 1 15 20 12 12 χ1 1 1 1 1 1 χ2 3 −1 0 τ σ χ3 3 −1 0 σ τ χ4 4 0 1 −1 −1 χ5 5 1 −1 0 0 1 p 1 p τ = (1 + 5); σ = (1 − 5) 2 2 well-known is Todd{Coxeter coset enumeration, which converts a presenta- tion into a permutation representation, and is well described in many places, such as [11]. From a (faithful) permutation representation it is then (in prin- ciple) possible to obtain at least any irreducible representation over any finite field, by using `Meataxe' techniques described by Richard Parker [16]. A gen- eralization of these methods to characteristic zero has recently been described by Parker [17]. Basically these methods enable one to chop any given rep- resentation into its irreducible constituents, and then tensor representations together to produce new ones to chop up, and so on. What we are concerned with here, however, is something more basic, namely how to construct a matrix representation of a group from scratch, when no representation at all is known to begin with. We also assume that no presentation is known, or at least that no presentation can be used to produce a sufficiently small permutation representation. Note: the original title of my lectures was something like \Computer construction of matrix representations of sporadic simple groups over finite fields”, but it gradually became clear that almost every word of the title was redundant, and that \Construction of groups" was the most the various ideas had in common (and even the word \groups" was a trifle restrictive). The present title is a (somewhat unhappy) compromise between the two extremes. 2 A5 @ @ @ h(12)(34); (123)i =A4 S3 = h(123); (12)(45)i @ @ @ A3 = h(123)i Figure 1: Generating A5 from subgroups 2 A small example We illustrate the basic ideas by considering the 3-dimensional representations of A5 mentioned above. Now we know that A5 has a subgroup A4 obtained by fixing one of the five points, and that this subgroup is maximal since it has prime index. Fixing another point we obtain a subgroup A3, and by 2-transitivity there is an element of A5 interchanging these two points, and therefore normalizing A3 to S3. By maximality, these subgroups generate A5, and the situation is as shown in Fig. 1. In the figure, we also give generating permutations for these subgroups, although the figure can equally well be understood at the level of abstract groups. If we now wish to construct one of the 3-dimensional representations of A5, we can start by constructing its restriction to A4. For simplicity we assume that the characteristic of the underlying field is not 2 or 3. Then it is easy to see that the character restricts to A4 as the unique 3-dimensional irreducible, and the corresponding representation may be defined by 0 1 0 0 1 (12)(34) 7! @ 0 −1 0 A 0 0 −1 0 0 1 0 1 (123) 7! @ 0 0 1 A 1 0 0 (In general, an inductive approach allows us to assume anything we wish 3 about properties of the proper subgroups of our group.) 0 0 1 0 1 The next step is to adjoin an element of order 2 conjugating @ 0 0 1 A 1 0 0 0 1 0 0 1 to its inverse. One obvious possibility is @ 0 0 1 A, but this extends A4 0 1 0 to S4, not to A5. We actually need to look at all such involutions, in order to pick the right one(s). In this particular case, it is easy to show from 0 0 1 0 1 first principles that the elements inverting @ 0 0 1 A are exactly those of 1 0 0 0 α β γ 1 0 a b c 1 the form @ β γ α A. (To see this, note that if the matrix @ d e f A γ α β g h i conjugates the given element to its inverse, then 0 a b c 1 0 0 1 0 1 0 0 0 1 1 0 a b c 1 @ d e f A @ 0 0 1 A = @ 1 0 0 A @ d e f A g h i 1 0 0 0 1 0 g h i 0 c a b 1 0 g h i 1 ) @ f d e A = @ a b c A ; i g h d e f whence c = g = e, a = h = f, b = i = d, as required.) The extra condition that it is an involution gives α2 + β2 + γ2 = 1; and αβ + βγ + γα = 0; while the fact that all involutions in A5 have trace −1 gives α + β + γ = −1: In fact these three equations are not independent, and we obtain a one- parameter family of solutions. To find which ones actually give rise to A5, we need some more information. If the field is finite, we can of course try all cases until we have eliminated all but the correct answer(s). If the field is infinite, however, we need to use some more structure of the group. 4 In the present case, for example, we could use what we know about A5 to say that without loss of generality our extra element represents (12)(45), and 0 1 0 0 1 therefore has product of order 3 with our original element @ 0 −1 0 A, 0 0 −1 representing (12)(34). This product is 0 1 0 0 1 0 α β γ 1 0 α β γ 1 @ 0 −1 0 A @ β γ α A = @ −β −γ −α A ; 0 0 −1 γ α β −γ −α −β and if this is to have order 3 then it has trace 0. Thus we obtain α−γ−β = 0, 1 which together with α + β + γ = 1 gives α = β + γ = 2 , and substituting 2 2 2 1 into α + β + γ = 1 we obtain βγ = − 4 , whence β and γ are the roots of 2 1 1 the quadratic equation x − 2 x − 4 = 0, namely 1 p β; γ = (1 ± 5): 4 These two possibilities for the extra element, namely 0 1 σ τ 1 0 1 τ σ 1 1 1 σ τ 1 and τ σ 1 2 @ A 2 @ A τ 1 σ σ 1 τ p p 1 1 where τ = 2 (1 + 5) is the golden ratio, and σ = 2 (1 − 5), correspond to the two different 3-dimensional representations of A5. 3 Some variants We have already described all the important points in the method used to construct from scratch matrix representations of the sporadic groups, from Janko's construction of J1 published in 1965 [6], to my construction of the Monster in collaboration with Linton, Parker and Walsh [12], [27]. How- ever, to give more of the flavour of what was actually done in the finite-field cases, we describe slightly different methods for (a) obtaining the complete parametrization of all extending elements, and (b) determining which one(s) of these extending elements give rise to the desired group. We keep the same example as above. 5 Suppose we have two elements x and y which both invert the 3-cycle (123). Then xy−1 centralizes it. Thus the essential step is to find the centralizer of this 3-cycle (or of whatever group appears in its place in larger examples). Now, provided the field has characteristic not 3, and provided there is a primi- tive cube root ! of unity in the field, we find that the representation restricted to A3 is the direct sum of its three 1-dimensional representations, acting on the three 1-spaces spanned by the three eigenvectors (1; 1; 1), (1; !; !2) and (1;!2;!). By changing to a basis of eigenvectors, we immediately see that the centralizer consists of all diagonal matrices, constituting a 3-parameter family. Changing basis back again we obtain the centralizer as the set of matrices 0 α β γ 1 @ γ α β A β γ α and can continue as before.
Load more

Recommended publications
  • Completing the Brauer Trees for the Sporadic Simple Lyons Group
    COMPLETING THE BRAUER TREES FOR THE SPORADIC SIMPLE LYONS GROUP JURGEN¨ MULLER,¨ MAX NEUNHOFFER,¨ FRANK ROHR,¨ AND ROBERT WILSON Abstract. In this paper we complete the Brauer trees for the sporadic sim- ple Lyons group Ly in characteristics 37 and 67. The results are obtained using tools from computational representation theory, in particular a new con- densation technique, and with the assistance of the computer algebra systems MeatAxe and GAP. 1. Introduction 1.1. In this paper we complete the Brauer trees for the sporadic simple Lyons group Ly in characteristics 37 and 67. The results are stated in Section 2, and will also be made accessible in the character table library of the computer algebra system GAP and electronically in [1]. The shape of the Brauer trees as well as the labelling of nodes up to algebraic conjugacy of irreducible ordinary characters had already been found in [8, Section 6.19.], while here we complete the trees by determining the labelling of the nodes on their real stems and their planar embedding; proofs are given in Section 4. Together with the results in [8, Section 6.19.] for the other primes dividing the group order, this completes all the Brauer trees for Ly. Our main computational workhorse is fixed point condensation, which originally was invented for permutation modules in [20], but has been applied to different types of modules as well. To our knowledge, the permutation module we have condensed is the largest one for which this has been accomplished so far. The theoretical background of the idea of condensation is described in Section 3.
    [Show full text]
  • Moonshines for L2(11) and M12
    Moonshines for L2(11) and M12 Suresh Govindarajan Department of Physics Indian Institute of Technology Madras (Work done with my student Sutapa Samanta) Talk at the Workshop on Modular Forms and Black Holes @NISER, Bhubaneswar on January 13. 2017 Plan Introduction Some finite group theory Moonshine BKM Lie superalgebras Introduction Classification of Finite Simple Groups Every finite simple group is isomorphic to one of the following groups: (Source: Wikipedia) I A cyclic group with prime order; I An alternating group of degree at least 5; I A simple group of Lie type, including both I the classical Lie groups, namely the groups of projective special linear, unitary, symplectic, or orthogonal transformations over a finite field; I the exceptional and twisted groups of Lie type (including the Tits group which is not strictly a group of Lie type). I The 26 sporadic simple groups. The classification was completed in 2004 when Aschbacher and Smith filled the last gap (`the quasi-thin case') in the proof. Fun Reading: Symmetry and the Monster by Mark Ronan The sporadic simple groups I the Mathieu groups: M11, M12, M22, M23, M24; (found in 1861) I the Janko groups: J1, J2, J3, J4; (others 1965-1980) I the Conway groups; Co1, Co2, Co3; 0 I the Fischer groups; Fi22. Fi23, Fi24; I the Higman-Sims group; HS I the McLaughlin group: McL I the Held group: He; I the Rudvalis group Ru; I the Suzuki sporadic group: Suz; 0 I the O'Nan group: O N; I Harada-Norton group: HN; I the Lyons group: Ly; I the Thompson group: Th; I the baby Monster group: B and Sources: Wikipedia and Mark Ronan I the Fischer-Griess Monster group: M Monstrous Moonshine Conjectures I The j-function has the followed q-series: (q = exp(2πiτ)) j(τ)−744 = q−1+[196883+1] q+[21296876+196883+1] q2+··· I McKay observed that 196883 and 21296876 are the dimensions of the two smallest irreps of the Monster group.
    [Show full text]
  • The Logbook of Pointed Hopf Algebras Over the Sporadic Groups
    THE LOGBOOK OF POINTED HOPF ALGEBRAS OVER THE SPORADIC SIMPLE GROUPS N. ANDRUSKIEWITSCH, F. FANTINO, M. GRANA˜ AND L. VENDRAMIN Contents Introduction 1 1. Algorithms 2 1.1. Algorithms for type D 2 1.2. Structure constants 4 1.3. Bases for permutation groups 4 1.4. An algorithm for involutions 4 2. Some auxiliary groups 4 2.1. The groups A9, A11, A12, S12 5 2.2. The group L5(2) 5 2.3. The group O7(3) 5 + 2.4. The group O8 (2) 5 − 2.5. The group O10(2) 6 2.6. The exceptional group G2(4) 6 2.7. The exceptional groups G2(3) and G2(5) 7 2.8. The symplectic group S6(2) 7 2.9. The symplectic group S8(2) 7 2.10. TheautomorphismgroupoftheTitsgroup 7 2.11. Direct products 8 3. Proof of Theorem II 8 3.1. The Lyons group Ly 8 3.2. The Thompson group Th 10 3.3. The Janko group J4 11 3.4. The Fischer group Fi23 12 3.5. The Conway group Co1 13 3.6. The Harada-Norton group HN 14 ′ 3.7. The Fischer group Fi24 14 3.8. The Baby Monster group B 15 arXiv:1001.1113v2 [math.QA] 25 Oct 2010 3.9. The Monster group M 17 Appendix.Realandquasi-realconjugacyclasses 18 References 21 Introduction In these notes, we give details on the proofs performed with GAP of the theorems of our paper [AFGV2]. Here we discuss the algorithms implemented for studying Date: October 31, 2018. 2000 Mathematics Subject Classification. 16W30; 17B37.
    [Show full text]
  • 1 Introduction
    On Sims' presentation for Lyons' simple group Holger W. Gollan Institute for Experimental Mathematics, University of Essen, Ellernstr. 29, D{45326 Essen, Germany email: [email protected] George Havas Centre for Discrete Mathematics and Computing Department of Computer Science and Electrical Engineering The University of Queensland, Queensland 4072, Australia http://www.it.uq.edu.au/»havas Abstract This paper gives a veri¯cation that the corrected Sims presentation is indeed a presentation of Lyons simple group. We prove that Lyons origi- nal characterization of his new simple group works inside a permutation group of degree 8 835 156. 1 Introduction In his original paper [7], Lyons describes a new ¯nite simple group Ly with the following two properties: Ly has an involution t such that its centralizer CenLy(t) is isomorphic to the double cover 2A11 of the alternating group A11 , and additionally t 2= Z¤(Ly). Sims [11] outlined a presentation for Ly , together with a proof for existence and uniqueness of such a group, but the details have never been published. Nevertheless, others have used this presentation to verify matrix representations for Ly (see e.g. Meyer, Neutsch and Parker [8], and Jansen and Wilson [6]), although the original presentation was not fully correct [6]. Cooperman, Finkelstein, Tselman and York [1] have used probabilistic algorithms and the representation of Ly · GL(111; 5) by Meyer, Neutsch and Parker to compute a permutation group G of degree 9 606 125 that should be isomorphic to Lyons simple group Ly . The ¯rst author [2] has then used Sims' ideas of bases and strong generating sets [10], together with 2 Holger Gollan and George Havas some lengthy calculations and additional arguments, to prove that G is indeed a group in which the two hypotheses of Lyons' original paper hold.
    [Show full text]
  • A Representation for the Lyons Group in GL2480(4), and a New Uniqueness Proof
    A representation for the Lyons group in GL2480(4), and a new uniqueness proof Robert A. Wilson School of Mathematics and Statistics, The University of Birmingham published in Arch. Math. (Basel) 70 (1998), 11{15 Abstract We show how to construct a representation of the Lyons sporadic simple group in 2480 dimensions over GF(4), which is the smallest faithful representation in characteristic 2. On the way, we construct the smallest representation of G2(5) in characteristic 2, which has degree 124. Finally, we will give a new uniqueness proof for the Lyons group. MSC 20C34, 20D08 1 Introduction This note is a companion to [6], in which a representation of the Lyons group Ly in GL651(3) is constructed. Much of the group-theoretical part of the present construction is the same as before, while the representation- theoretical part obviously differs. The methods are by now fairly standard, following the general procedure described in [11], and making use of the Meat-axe package [10], [12]. The smallest representation of the Lyons group in characteristic 2 is of degree 2480, and the smallest field over which this representation is realisable is GF(4). Indeed, there are two such representations, which are dual to each other, and which are simply the reductions modulo 2 of the complex 1 irreducibles of the same degree. We construct both of these representations. It turns out also that, because our chosen representation lifts to characteristic 0, we obtain as a bonus an easy proof of the uniqueness of a group of Lyons type. Our plan here is, as in [6], to amalgamate two subgroups G2(5) and 3: 2+1+2 5 L3(5) over their intersection 5 :GL2(5).
    [Show full text]
  • Uni International 300 N
    INFORMATION TO USERS This reproduction was made from a copy of a document sent to us for microfilming. While the most advanced technology has been used to photograph and reproduce this document, the quality of the reproduction is heavily dependent upon the quality of the material submitted. The following explanation of techniques is provided to help clarify markings or notations which may appear on this reproduction. 1.The sign or “target” for pages apparently lacking from the document photographed is “Missing Page(s)”. If it was possible to obtain the missing page(s) or section, they are spliced into the film along with adjacent pages. This may have necessitated cutting through an image and duplicating adjacent pages to assure complete continuity. 2. When an image on the film is obliterated with a round black mark, it is an indication of either blurred copy because of movement during exposure, duplicate copy, or copyrighted materials that should not have been filmed. For blurred pages, a good image of the page can be found in the adjacent frame. If copyrighted materials were deleted, a target note will appear listing the pages in the adjacent frame. 3. When a map, drawing or chart, etc., is part of the material being photographed, a definite method of “sectioning” the material has been followed. It is customary to begin filming at the upper left hand comer of a large sheet and to continue from left to right in equal sections with small overlaps. If necessary, sectioning is continued again—beginning below the first row and continuing on until complete.
    [Show full text]
  • FUSION SYSTEMS on P-GROUPS with an EXTRASPECIAL SUBGROUP of INDEX P
    FUSION SYSTEMS ON p-GROUPS WITH AN EXTRASPECIAL SUBGROUP OF INDEX p by RAUL´ MORAGUES MONCHO A thesis submitted to the University of Birmingham for the degreee of DOCTOR OF PHILOSOPHY School of Mathematics College of Engineering and Physical Sciences University of Birmingham August 2018 University of Birmingham Research Archive e-theses repository This unpublished thesis/dissertation is copyright of the author and/or third parties. The intellectual property rights of the author or third parties in respect of this work are as defined by The Copyright Designs and Patents Act 1988 or as modified by any successor legislation. Any use made of information contained in this thesis/dissertation must be in accordance with that legislation and must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the permission of the copyright holder. Abstract In this thesis we classify saturated fusion systems on p-groups S containing an extraspecial subgroup of index p for an arbitrary odd prime p. We prove that if 6 F is a saturated fusion system on S with Op(F) = 1 then either jSj ≤ p or S is isomorphic to a unique group of order pp−1. We either classify the fusion systems or cite references to show that F is known in all cases except when S is a Sylow p−1 p-subgroup of SL4(p), which remains as future work. When jSj = p with p ≥ 11 we describe new infinite exotic families related to those constructed by Parker and Stroth. A mis padres Consuelo y Juan Jos´e.
    [Show full text]
  • Maximal Subgroups of Sporadic Groups Was Pe- Tra (Beth) Holmes, Whose Phd Thesis on ‘Computing in the Monster’ Dates from 2002
    MAXIMAL SUBGROUPS OF SPORADIC GROUPS ROBERT A. WILSON Abstract. A systematic study of maximal subgroups of the sporadic simple groups began in the 1960s. The work is now almost complete, only a few cases in the Monster remaining outstanding. We give a survey of results obtained, and methods used, over the past 50 years, for the classification of maximal subgroups of sporadic simple groups, and their automorphism groups. 1. Introduction The subtitle of the ‘Atlas of Finite Groups’ [7] is ‘Maximal Subgroups and Or- dinary Characters for Simple Groups’. These two aspects of the study of finite simple groups remain at the forefront of research today. The Atlas was dedicated to collecting facts, not to providing proofs. It contains an extensive bibliography, but not citations at the point of use, making it difficult for the casual reader to track down proofs. In the ensuing 30 years, moreover, the landscape has changed dramatically, both with the appearance of new proofs in the literature, and with the ability of modern computer algebra systems to recompute much of the data in the twinkling of an eye. As far as maximal subgroups are concerned, shortly before the publication of the Atlas it became clear that the maximal subgroup project should be extended to almost simple groups. The reason for this is that it is not possible to deduce the maximal subgroups of an almost simple group directly from the maximal subgroups of the corresponding simple group. This was made clear by the examples described in [49], especially perhaps the maximal subgroup S5 of M12:2, which is neither the normalizer of a maximal subgroup of M12, nor the normalizer of the intersection of two non-conjugate maximal subgroups of M12.
    [Show full text]
  • Arxiv:1610.03625V2 [Math.GR]
    THE FSZ PROPERTIES OF SPORADIC SIMPLE GROUPS MARC KEILBERG Abstract. We investigate a possible connection between the FSZ properties of a group and its Sylow subgroups. We show that the simple groups G2(5) 6 and S6(5), as well as all sporadic simple groups with order divisible by 5 are not FSZ, and that neither are their Sylow 5-subgroups. The groups G2(5) and HN were previously established as non-FSZ by Peter Schauenburg; we present alternative proofs. All other sporadic simple groups and their Sylow subgroups are shown to be FSZ. We conclude by considering all perfect groups available through GAP with order at most 106, and show they are non-FSZ if and only if their Sylow 5-subgroups are non-FSZ. Introduction The FSZ properties for groups, as introduced by Iovanov et al. [4], arise from considerations of certain invariants of the representation categories of semisimple Hopf algebras known as higher Frobenius-Schur indicators [5, 10, 11]. See [9] for a detailed discussion of the many important uses and generalizations of these in- variants. When applied to Drinfeld doubles of finite groups, these invariants are described entirely in group theoretical terms, and are in particular invariants of the group itself. The FSZ property is then concerned with whether or not these invariants are always integers—which gives the Z in FSZ. While the FSZ and non-FSZ group properties are well-behaved with respect to direct products [4, Example 4.5], there is currently little reason to suspect a partic- ularly strong connection to proper subgroups which are not direct factors.
    [Show full text]
  • Simple Groups Transitive on Internal Flags
    JOURNAL OF ALGEBRA 39, 375-409 (1976) Simple Groups Transitive on Internal Flags MICHAEL E. O’NAN Department of Mathematics, Rutgers University, New Brunswick, New Jersey AND RONALD SOLOMON Department of Mathematics, University of Chicago, Chicago, Illinois Communicated by Walter Feit Received February 5, 1975 The 2-rank r of a group G is the rank of the largest elementary abelian 2-subgroup of G. If E is an elementary abelian group of rank r and E is a normal subgroup of the group H, H is said to be transitive on the flags of E, if given two chains E,CE2C...CE,-1CE,.= E, E,‘CE,‘C...CE;-,CE,.‘= E, of subgroupsof E with Ei and Ei’ of rank i, there is an element h of H such that Ein = Ei for all i = l,..., r. With this terminology, we prove: THEOREM A. Let G bea simplegroupof 2-rank T, and supposethat G has an elementaryabelian 2-group E of rank r suchthat No(E) is transitive on the fEags of E. Then, G is isomorphicto oneof the following groups: (4 PsL(2, q), q odd, q 2 5, (ii) PSL(3, q), q odd, (iii) PSU(3, q), q odd, (iv) Ml1 , a Mathieu group, (4 PW3,4), (vi) A,, 375 Copyright 0 1976 by Academic Press, Inc. All rights of reproduction in any form reserved. 376 O’NAN AND SOLOMON (vii) a group of Ree type of characteristic3, (viii) J1 , the smallestJanko group, (ix) G(q), q 04 (4 h2(q), q odd, (xi> the simplegroup of order 2g * 34 .
    [Show full text]
  • The Classification of the Finite Simple Groups, Number 3
    http://dx.doi.org/10.1090/surv/040.3 Selected Titles in This Series 55 J. Scott Carter and Masahico Saito, Knotted surfaces and their diagrams, 1998 54 Casper Goffman, Togo Nishiura, and Daniel Waterman, Homeomorphisms in analysis, 1997 53 Andreas Kriegl and Peter W. Michor, The convenient setting of global analysis, 1997 52 V. A. Kozlov, V. G. Maz'ya? and J. Rossmann, Elliptic boundary value problems in domains with point singularities, 1997 51 Jan Maly and William P. Ziemer, Fine regularity of solutions of elliptic partial differential equations, 1997 50 Jon Aaronson, An introduction to infinite ergodic theory, 1997 49 R. E. Showalter, Monotone operators in Banach space and nonlinear partial differential equations, 1997 48 Paul-Jean Cahen and Jean-Luc Chabert, Integer-valued polynomials, 1997 47 A. D. Elmendorf, I. Kriz, M. A. Mandell, and J. P. May (with an appendix by M. Cole), Rings, modules, and algebras in stable homotopy theory, 1997 46 Stephen Lipscomb, Symmetric inverse semigroups, 1996 45 George M. Bergman and Adam O. Hausknecht, Cogroups and co-rings in categories of associative rings, 1996 44 J. Amoros, M. Burger, K. Corlette, D. Kotschick, and D. Toledo, Fundamental groups of compact Kahler manifolds, 1996 43 James E. Humphreys, Conjugacy classes in semisimple algebraic groups, 1995 42 Ralph Freese, Jaroslav Jezek, and J. B. Nation, Free lattices, 1995 41 Hal L. Smith, Monotone dynamical systems: an introduction to the theory of competitive and cooperative systems, 1995 40.3 Daniel Gorenstein, Richard Lyons, and Ronald Solomon,
    [Show full text]
  • The Radical 2-Subgroups of Some Sporadic Simple Groups
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE Journal of Algebra 248, 237–264 (2002) provided by Elsevier - Publisher Connector doi:10.1006/jabr.2001.8992, available online at http://www.idealibrary.com on The Radical 2-Subgroups of Some Sporadic Simple Groups Satoshi Yoshiara Division of Mathematical Sciences, Osaka Kyoiku University, Kashiwara, Osaka 582-8582, Japan E-mail: [email protected] Communicated by Gernot Stroth Received April 15, 2001 As a continuation of previous work (S. Yoshiara, 2000, J. Algebra 233, 309–341), this paper determines the radical 2-subgroups of the sporadic simple groups Ly O N HS , and HN. 2002 Elsevier Science (USA) 1. INTRODUCTION A nontrivial p-subgroup R of a finite group G is called radical (resp. centric)ifR = OpNGR (resp. every p-element centralizing R lies in ZR. We use the symbol pG to denote the set of radical p-subgroups of G. As a continuation of the papers [24] and [12], the present paper determines the 2-radical subgroups up to conjugacy of the sporadic simple groups Ly of Lyons, HS of Higman–Sims, O N of O’Nan, and HN = F5 of Harada–Norton. This completes the radical 2-subgroups of all sporadic sim- ple groups, except the Monster and the baby Monster, because the papers [24] and [12] determine those of J4Co2 Th Fi22, and Fi24, and those of the remaining sporadics are treated in [2] (the Mathieu groups), [3] He, [11] (J3), [7, 14] McL, [4] Co3, [17] Co1, [18] Rud, [25] Suz, and [5] Fi23.
    [Show full text]