DOCSLIB.ORG

Applying the Classification of Finite Simple Groups

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Applying the Classification of Finite Simple Groups Applying the Classification of Finite Simple Groups: A User's Guide (draft3, as submitted to AMS, 12sept2017) Stephen D. Smith Department of Mathematics (m/c 249), University of Illinois at Chicago, 851 S. Morgan, Chicago, Illinois 60607-7045 E-mail address: [email protected] 2010 Mathematics Subject Classification. 20D05, 20D06, 20D08, 20Bxx, 20Cxx, 20E25, 20E28, 20Jxx, 05E15, 05E18, 55Uxx Abstract. This book surveys a wide range of applications of the Classification of Finite Simple Groups (CFSG): both within finite group theory itself, and in other mathematical areas which make use of group theory. The book is based on the author's lectures at the September 2015 Venice Summer School on Finite Groups; and so may in particular be of use in a graduate course. It should also be more widely useful as an introduction and basic reference; in addition it indicates fuller citations to the appropriate literature, for readers who wish to go on to more detailed sources. v To Judy|for exemplary patience Contents Preface xi Origin of the book, and structure of the chapters xi Some notes on using the book as a course text xi Acknowledgments xii Chapter 1. Background: simple groups and their properties 1 Introduction: statement of the CFSG|the list of simple groups 1 1.1. Alternating groups 2 1.2. Sporadic groups 3 1.3. Groups of Lie type 5 Some easy applications of the CFSG-list 20 1.4. Structure of K-groups: via components in F ∗(G) 20 1.5. Outer automorphisms of simple groups 23 1.6. Further CFSG-consequences: e.g. doubly-transitive groups 25 Chapter 2. Outline of the proof of the CFSG: some main ideas 29 2.0. A start: proving the Odd/Even Dichotomy Theorem 29 2.1. Treating the Odd Case: via standard form 36 2.2. Treating the Even Case: via trichotomy and standard type 38 2.3. Afterword: comparison with later CFSG approaches 44 Applying the CFSG toward Quillen's Conjecture on Sp(G) 45 2.4. Introduction: the poset Sp(G) and the contractibility conjecture 45 2.5. Quillen-dimension and the solvable case 47 2.6. The reduction of the p-solvable case to the solvable case 49 2.7. Other uses of the CFSG in the Aschbacher-Smith proof 52 Chapter 3. Thompson Factorization|and its failure: FF-methods 55 Introduction: Some forms of the Frattini factorization 55 3.1. Thompson Factorization: using J(T ) as weakly-closed \W " 57 3.2. Failure of Thompson Factorization: FF-methods 59 3.3. Pushing-up: FF-modules in Aschbacher blocks 61 3.4. Weak-closure factorizations: using other weakly-closed \W " 66 Applications related to the Martino-Priddy Conjecture 70 3.5. The conjecture on classifying spaces and fusion systems 70 3.6. Oliver's proof of Martino-Priddy using the CFSG 72 3.7. Oliver's conjecture on J(T ) for p odd 74 Chapter 4. Recognition theorems for simple groups 77 Introduction: finishing classification problems 77 4.1. Recognizing alternating groups 80 vii viii CONTENTS 4.2. Recognizing Lie-type groups 80 4.3. Recognizing sporadic groups 82 Applications to recognizing some quasithin groups 84 4.4. Background: 2-local structure in the quasithin analysis 84 4.5. Recognizing Rank-2 Lie-type groups 86 4.6. Recognizing the Rudvalis group Ru 87 Chapter 5. Representation theory of simple groups 89 Introduction: some standard general facts about representations 89 5.1. Representations for alternating and symmetric groups 91 5.2. Representations for Lie-type groups 92 5.3. Representations for sporadic groups 97 Applications to Alperin's conjecture 98 5.4. Introduction: the Alperin Weight Conjecture (AWC) 98 5.5. Reductions of the AWC to simple groups 99 5.6. A closer look at verification for the Lie-type case 100 A glimpse of some other applications of representations 102 Chapter 6. Maximal subgroups and primitive representations 105 Introduction: maximal subgroups and primitive actions 105 6.1. Maximal subgroups of symmetric and alternating groups 106 6.2. Maximal subgroups of Lie-type groups 110 6.3. Maximal subgroups of sporadic groups 113 Some applications of maximal subgroups 114 6.4. Background: broader areas of applications 114 6.5. Random walks on Sn and minimal generating sets 115 6.6. Applications to p-exceptional linear groups 117 6.7. The probability of 2-generating a simple group 119 Chapter 7. Geometries for simple groups 121 Introduction: the influence of Tits's theory of buildings 121 7.1. The simplex for Sn; later giving an apartment for GLn(q) 122 7.2. The building for a Lie-type group 125 7.3. Geometries for sporadic groups 129 Some applications of geometric methods 131 7.4. Geometry in classification problems 131 7.5. Geometry in representation theory 133 7.6. Geometry applied for local decompositions 136 Chapter 8. Some fusion techniques for classification problems 139 8.1. Glauberman's Z∗-theorem 139 8.2. The Thompson Transfer Theorem 143 8.3. The Bender-Suzuki Strongly Embedded Theorem 145 Analogous p-fusion results for odd primes p 149 ∗ 8.4. The Zp -theorem for odd p 149 8.5. Thompson-style transfer for odd p 150 8.6. Strongly p-embedded subgroups for odd p 150 Chapter 9. Some applications close to finite group theory 153 9.1. Distance-transitive graphs 153 CONTENTS ix 9.2. The proportion of p-singular elements 154 9.3. Root subgroups of maximal tori in Lie-type groups 156 Some applications more briefly treated 157 9.4. Frobenius' conjecture on solutions of xn = 1 157 9.5. Subgroups of prime-power index in simple groups 158 9.6. Application to 2-generation and module cohomology 159 9.7. Minimal nilpotent covers and solvability 160 9.8. Computing composition factors of permutation groups 160 Chapter 10. Some applications farther afield from finite groups 161 10.1. Polynomial subgroup-growth in finitely-generated groups 161 10.2. Relative Brauer groups of field extensions 162 10.3. Monodromy groups of coverings of Riemann surfaces 163 Some exotic applications more briefly treated 165 10.4. Locally finite simple groups and Moufang loops 165 10.5. Waring's problem for simple groups 167 10.6. Expander graphs and approximate groups 167 Appendix 169 Appendix A. Some supplementary notes to the text 171 A.1. Notes for 6.1.1: deducing the structures-list for Sn 171 A.2. Notes for 8.2.1: the cohomological view of the transfer map 172 A.3. Notes for (8.3.4): some details of proofs in Holt's paper 174 Appendix B. Further remarks on certain Exercises 183 B.1. Some exercises from Chapter 1 183 B.2. Some exercises from Chapter 4 184 B.3. Some exercises from Chapter 5 191 B.4. Some exercises from Chapter 6 193 Bibliography 199 Index 211 Preface Most mathematicians are at least aware of the Classification of Finite Simple Groups (CFSG)|a major project involving work by hundreds of researchers. The work was largly completed by about 1983; though final publication of the \qua- sithin" part was delayed until 2004. And since the 1980s, the result has had a huge influence on work in finite group theory, and in very many adjacent fields of mathematics. This book attempts to survey and sample a number of topics, from the very large and increasingly active research area of applications of the CFSG. The book can't hope to systematically cover all applications. Indeed the par- ticular applications chosen were mainly provided by contacting colleagues who are experts in many related areas. So the resulting collection of material might seem somewhat scattered; however, I've tried to present the choices within contexts of wider areas of applications, and I am grateful to the referee for helpful suggestions in that direction. Origin of the book, and structure of the chapters This book began life as a series of 10 two-hour lectures, which I was invited to give during the September 2015 Venice Summer School on Finite Groups. The material in the book has been adapted only fairly lightly from that lecture format: mainly in order to try to preserve the introductory, and comparatively informal, tone of the original. The primary difference in the book form has been to try to bring the cross-references, and the literature citations, up to the more formal level expected in a published reference book. I'll mention briefly one particular feature of the chapters in the book, arising from the lectures. Each original lecture was divided into two parts: typically, the first part introduced some basic theory from a particular aspect of the CFSG; and the second (\applications") part then demonstrated ways in which that theory can be put to use. The 10 lectures have now become the 10 chapters in this book format; and the reader will notice, even from the Table of Contents, that the later sections of each chapter usually reflect the applications-focus of the second part of the original lecture. Some notes on using the book as a course text For those who wish to use the book as a course text: The material is intended to be accessible to an audience with basic mathe- matical training; for example, to beginning graduate students, with at least an undergraduate course in abstract algebra. But preferably the background should also include first-year graduate algebra, especially some experience with examples of the most familiar types of groups; and ideally at least the basics of Lie algebras. xi xii PREFACE It will also be helpful, at times, to have some exposure to various adjacent areas of mathematics: for example, the fundamentals of algebraic topology and homological algebra, and possibly also a little combinatorics.
Load more

Recommended publications
  • Simple Groups, Permutation Groups, and Probability
    JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 12, Number 2, April 1999, Pages 497{520 S 0894-0347(99)00288-X SIMPLE GROUPS, PERMUTATION GROUPS, AND PROBABILITY MARTIN W. LIEBECK AND ANER SHALEV 1. Introduction In recent years probabilistic methods have proved useful in the solution of several problems concerning finite groups, mainly involving simple groups and permutation groups. In some cases the probabilistic nature of the problem is apparent from its very formulation (see [KL], [GKS], [LiSh1]); but in other cases the use of probability, or counting, is not entirely anticipated by the nature of the problem (see [LiSh2], [GSSh]). In this paper we study a variety of problems in finite simple groups and fi- nite permutation groups using a unified method, which often involves probabilistic arguments. We obtain new bounds on the minimal degrees of primitive actions of classical groups, and prove the Cameron-Kantor conjecture that almost sim- ple primitive groups have a base of bounded size, apart from various subset or subspace actions of alternating and classical groups. We use the minimal degree result to derive applications in two areas: the first is a substantial step towards the Guralnick-Thompson genus conjecture, that for a given genus g, only finitely many non-alternating simple groups can appear as a composition factor of a group of genus g (see below for definitions); and the second concerns random generation of classical groups. Our proofs are largely based on a technical result concerning the size of the intersection of a maximal subgroup of a classical group with a conjugacy class of elements of prime order.
    [Show 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].
    [Show full text]
  • The General Linear Group
    18.704 Gabe Cunningham 2/18/05 [email protected] The General Linear Group Definition: Let F be a field. Then the general linear group GLn(F ) is the group of invert- ible n × n matrices with entries in F under matrix multiplication. It is easy to see that GLn(F ) is, in fact, a group: matrix multiplication is associative; the identity element is In, the n × n matrix with 1’s along the main diagonal and 0’s everywhere else; and the matrices are invertible by choice. It’s not immediately clear whether GLn(F ) has infinitely many elements when F does. However, such is the case. Let a ∈ F , a 6= 0. −1 Then a · In is an invertible n × n matrix with inverse a · In. In fact, the set of all such × matrices forms a subgroup of GLn(F ) that is isomorphic to F = F \{0}. It is clear that if F is a finite field, then GLn(F ) has only finitely many elements. An interesting question to ask is how many elements it has. Before addressing that question fully, let’s look at some examples. ∼ × Example 1: Let n = 1. Then GLn(Fq) = Fq , which has q − 1 elements. a b Example 2: Let n = 2; let M = ( c d ). Then for M to be invertible, it is necessary and sufficient that ad 6= bc. If a, b, c, and d are all nonzero, then we can fix a, b, and c arbitrarily, and d can be anything but a−1bc. This gives us (q − 1)3(q − 2) matrices.
    [Show full text]
  • Normal Subgroups of the General Linear Groups Over Von Neumann Regular Rings L
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 96, Number 2, February 1986 NORMAL SUBGROUPS OF THE GENERAL LINEAR GROUPS OVER VON NEUMANN REGULAR RINGS L. N. VASERSTEIN1 ABSTRACT. Let A be a von Neumann regular ring or, more generally, let A be an associative ring with 1 whose reduction modulo its Jacobson radical is von Neumann regular. We obtain a complete description of all subgroups of GLn A, n > 3, which are normalized by elementary matrices. 1. Introduction. For any associative ring A with 1 and any natural number n, let GLn A be the group of invertible n by n matrices over A and EnA the subgroup generated by all elementary matrices x1'3, where 1 < i / j < n and x E A. In this paper we describe all subgroups of GLn A normalized by EnA for any von Neumann regular A, provided n > 3. Our description is standard (see Bass [1] and Vaserstein [14, 16]): a subgroup H of GL„ A is normalized by EnA if and only if H is of level B for an ideal B of A, i.e. E„(A, B) C H C Gn(A, B). Here Gn(A, B) is the inverse image of the center of GL„(,4/S) (when n > 2, this center consists of scalar invertible matrices over the center of the ring A/B) under the canonical homomorphism GL„ A —►GLn(A/B) and En(A, B) is the normal subgroup of EnA generated by all elementary matrices in Gn(A, B) (when n > 3, the group En(A, B) is generated by matrices of the form (—y)J'lx1'Jy:i''1 with x € B,y £ A,l < i ^ j < n, see [14]).
    [Show full text]
  • Categorical Semantics of Constructive Set Theory
    Categorical semantics of constructive set theory Beim Fachbereich Mathematik der Technischen Universit¨atDarmstadt eingereichte Habilitationsschrift von Benno van den Berg, PhD aus Emmen, die Niederlande 2 Contents 1 Introduction to the thesis 7 1.1 Logic and metamathematics . 7 1.2 Historical intermezzo . 8 1.3 Constructivity . 9 1.4 Constructive set theory . 11 1.5 Algebraic set theory . 15 1.6 Contents . 17 1.7 Warning concerning terminology . 18 1.8 Acknowledgements . 19 2 A unified approach to algebraic set theory 21 2.1 Introduction . 21 2.2 Constructive set theories . 24 2.3 Categories with small maps . 25 2.3.1 Axioms . 25 2.3.2 Consequences . 29 2.3.3 Strengthenings . 31 2.3.4 Relation to other settings . 32 2.4 Models of set theory . 33 2.5 Examples . 35 2.6 Predicative sheaf theory . 36 2.7 Predicative realizability . 37 3 Exact completion 41 3.1 Introduction . 41 3 4 CONTENTS 3.2 Categories with small maps . 45 3.2.1 Classes of small maps . 46 3.2.2 Classes of display maps . 51 3.3 Axioms for classes of small maps . 55 3.3.1 Representability . 55 3.3.2 Separation . 55 3.3.3 Power types . 55 3.3.4 Function types . 57 3.3.5 Inductive types . 58 3.3.6 Infinity . 60 3.3.7 Fullness . 61 3.4 Exactness and its applications . 63 3.5 Exact completion . 66 3.6 Stability properties of axioms for small maps . 73 3.6.1 Representability . 74 3.6.2 Separation . 74 3.6.3 Power types .
    [Show full text]
  • Variational Problems on Flows of Diffeomorphisms for Image Matching
    QUARTERLY OF APPLIED MATHEMATICS VOLUME LVI, NUMBER 3 SEPTEMBER 1998, PAGES 587-600 VARIATIONAL PROBLEMS ON FLOWS OF DIFFEOMORPHISMS FOR IMAGE MATCHING By PAUL DUPUIS (LCDS, Division of Applied Mathematics, Brown University, Providence, RI), ULF GRENANDER (Division of Applied Mathematics, Brown University, Providence, Rl), AND MICHAEL I. MILLER (Dept. of Electrical Engineering, Washington University, St. Louis, MO) Abstract. This paper studies a variational formulation of the image matching prob- lem. We consider a scenario in which a canonical representative image T is to be carried via a smooth change of variable into an image that is intended to provide a good fit to the observed data. The images are all defined on an open bounded set GcR3, The changes of variable are determined as solutions of the nonlinear Eulerian transport equation ==v(rj(s;x),s), r)(t;x)=x, (0.1) with the location 77(0;x) in the canonical image carried to the location x in the deformed image. The variational problem then takes the form arg mm ;||2 + [ |Tor?(0;a;) - D(x)\2dx (0.2) JG where ||v|| is an appropriate norm on the velocity field v(-, •), and the second term at- tempts to enforce fidelity to the data. In this paper we derive conditions under which the variational problem described above is well posed. The key issue is the choice of the norm. Conditions are formulated under which the regularity of v(-, ■) imposed by finiteness of the norm guarantees that the associated flow is supported on a space of diffeomorphisms. The problem (0.2) can Received March 15, 1996.
    [Show full text]
  • Factorizations of Almost Simple Groups with a Solvable Factor, and Cayley Graphs of Solvable Groups
    Factorizations of almost simple groups with a solvable factor, and Cayley graphs of solvable groups Cai Heng Li, Binzhou Xia (Li) The University of Western Australia, Crawley 6009, WA, Aus- tralia. Email: [email protected] (Xia) Peking University, Beijing 100871, China. Email: [email protected] arXiv:1408.0350v3 [math.GR] 25 Feb 2016 Abstract A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize s-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the cycles, every non- bipartite connected 3-arc-transitive Cayley graph of a solvable group is a cover of the Petersen graph or the Hoffman-Singleton graph. Key words and phrases: factorizations; almost simple groups; solvable groups; s-arc-transitive graphs AMS Subject Classification (2010): 20D40, 20D06, 20D08, 05E18 Acknowledgements. We would like to thank Cheryl Praeger for valuable com- ments. We also thank Stephen Glasby and Derek Holt for their help with some of the computation in Magma. The first author acknowledges the support of a NSFC grant and an ARC Discovery Project Grant. The second author acknowledges the support of NSFC grant 11501011. Contents Chapter 1. Introduction 5 1.1. Factorizations of almost simple groups 5 1.2. s-Arc transitive Cayley graphs 8 Chapter 2. Preliminaries 11 2.1. Notation 11 2.2. Results on finite simple groups 13 2.3. Elementary facts concerning factorizations 16 2.4. Maximal factorizations of almost simple groups 18 Chapter 3. The factorizations of linear and unitary groups of prime dimension 21 3.1.
    [Show full text]
  • ELEMENTARY ABELIAN P-SUBGROUPS of ALGEBRAIC GROUPS
    ROBERT L. GRIESS, JR ELEMENTARY ABELIAN p-SUBGROUPS OF ALGEBRAIC GROUPS Dedicated to Jacques Tits for his sixtieth birthday ABSTRACT. Let ~ be an algebraically closed field and let G be a finite-dimensional algebraic group over N which is nearly simple, i.e. the connected component of the identity G O is perfect, C6(G °) = Z(G °) and G°/Z(G °) is simple. We classify maximal elementary abelian p-subgroups of G which consist of semisimple elements, i.e. for all primes p ~ char K. Call a group quasisimple if it is perfect and is simple modulo the center. Call a subset of an algebraic group total if it is in a toms; otherwise nontoral. For several quasisimple algebraic groups and p = 2, we define complexity, and give local criteria for whether an elementary abelian 2-subgroup of G is total. For all primes, we analyze the nontoral examples, include a classification of all the maximal elementary abelian p-groups, many of the nonmaximal ones, discuss their normalizers and fusion (i.e. how conjugacy classes of the ambient algebraic group meet the subgroup). For some cases, we give a very detailed discussion, e.g. p = 3 and G of type E6, E 7 and E 8. We explain how the presence of spin up and spin down elements influences the structure of projectively elementary abelian 2-groups in Spin(2n, C). Examples of an elementary abelian group which is nontoral in one algebraic group but toral in a larger one are noted. Two subsets of a maximal torus are conjugate in G iff they are conjugate in the normalizer of the torus; this observation, with our discussion of the nontoral cases, gives a detailed guide to the possibilities for the embedding of an elementary abelian p-group in G.
    [Show full text]
  • Atlasrep —A GAP 4 Package
    AtlasRep —A GAP 4 Package (Version 2.1.0) Robert A. Wilson Richard A. Parker Simon Nickerson John N. Bray Thomas Breuer Robert A. Wilson Email: [email protected] Homepage: http://www.maths.qmw.ac.uk/~raw Richard A. Parker Email: [email protected] Simon Nickerson Homepage: http://nickerson.org.uk/groups John N. Bray Email: [email protected] Homepage: http://www.maths.qmw.ac.uk/~jnb Thomas Breuer Email: [email protected] Homepage: http://www.math.rwth-aachen.de/~Thomas.Breuer AtlasRep — A GAP 4 Package 2 Copyright © 2002–2019 This package may be distributed under the terms and conditions of the GNU Public License Version 3 or later, see http://www.gnu.org/licenses. Contents 1 Introduction to the AtlasRep Package5 1.1 The ATLAS of Group Representations.........................5 1.2 The GAP Interface to the ATLAS of Group Representations..............6 1.3 What’s New in AtlasRep, Compared to Older Versions?...............6 1.4 Acknowledgements................................... 14 2 Tutorial for the AtlasRep Package 15 2.1 Accessing a Specific Group in AtlasRep ........................ 16 2.2 Accessing Specific Generators in AtlasRep ...................... 18 2.3 Basic Concepts used in AtlasRep ........................... 19 2.4 Examples of Using the AtlasRep Package....................... 21 3 The User Interface of the AtlasRep Package 33 3.1 Accessing vs. Constructing Representations...................... 33 3.2 Group Names Used in the AtlasRep Package..................... 33 3.3 Standard Generators Used in the AtlasRep Package.................. 34 3.4 Class Names Used in the AtlasRep Package...................... 34 3.5 Accessing Data via AtlasRep ............................
    [Show full text]
  • Irreducible Character Restrictions to Maximal Subgroups of Low-Rank Classical Groups of Type B and C
    IRREDUCIBLE CHARACTER RESTRICTIONS TO MAXIMAL SUBGROUPS OF LOW-RANK CLASSICAL GROUPS OF TYPE B AND C KEMPTON ALBEE, MIKE BARNES, AARON PARKER, ERIC ROON, AND A.A. SCHAEFFER FRY Abstract Representations are special functions on groups that give us a way to study abstract groups using matrices, which are often easier to understand. In particular, we are often interested in irreducible representations, which can be thought of as the building blocks of all representations. Much of the information about these representations can then be understood by instead looking at the trace of the matrices, which we call the character of the representation. This paper will address restricting characters to subgroups by shrinking the domain of the original representation to just the subgroup. In particular, we will discuss the problem of determining when such restricted characters remain irreducible for certain low-rank classical groups. 1. Introduction Given a finite group G, a (complex) representation of G is a homomorphism Ψ: G ! GLn(C). By summing the diagonal entries of the images Ψ(g) for g 2 G (that is, taking the trace of the matrices), we obtain the corresponding character, χ = Tr◦Ψ of G. The degree of the representation Ψ or character χ is n = χ(1). It is well-known that any character of G can be written as a sum of so- called irreducible characters of G. In this sense, irreducible characters are of particular importance in representation theory, and we write Irr(G) to denote the set of irreducible characters of G. Given a subgroup H of G, we may view Ψ as a representation of H as well, simply by restricting the domain.
    [Show full text]
  • Arxiv:2002.11183V2 [Math.AG]
    Arithmetic statistics on cubic surfaces Ronno Das April 6, 2020 Abstract In this paper we compute the distributions of various markings on smooth cubic surfaces defined over the finite field Fq, for example the distribution of pairs of points, ‘tritangents’ or ‘double sixes’. We also compute the (rational) cohomology of certain associated bundles and covers over complex numbers. 1 Introduction The classical Cayley–Salmon theorem implies that each smooth cubic surface over an algebraically closed field contains exactly 27 lines (see Section 2 for detailed definitions). In contrast, for a surface over a finite field Fq, all 27 lines are defined over Fq but not necessarily over Fq itself. In other words, the action of the Frobenius Frobq permutes the 27 lines and only fixes a (possibly empty) subset of them. It is also classical that the group of all such permutations, which can be identified with the Galois group of an appropriate extension or cover, is isomorphic to the Weyl group W(E6) of type E6. This permutation of the 27 lines governs much of the arithmetic of the surface S: evidently the n pattern of lines defined over Fq and, less obviously, the number of Fq points on S (or UConf S etc). Work of Bergvall and Gounelas [BG19] allows us to compute the number of cubic surfaces over Fq where Frobq induces a given permutation, or rather a permutation in a given conjugacy class of W(E6). The results in this paper can be thought of as a combinatorial (Theorem 1.1) or representation-theoretic (Theorem 2.3) reinterpretation of their computation.
    [Show full text]
  • 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]