Invariant Meromorphic Functions on Stein Manifolds
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
12.6 Further Topics on Simple Groups 387 12.6 Further Topics on Simple Groups
12.6 Further Topics on Simple groups 387 12.6 Further Topics on Simple Groups This Web Section has three parts (a), (b) and (c). Part (a) gives a brief descriptions of the 56 (isomorphism classes of) simple groups of order less than 106, part (b) provides a second proof of the simplicity of the linear groups Ln(q), and part (c) discusses an ingenious method for constructing a version of the Steiner system S(5, 6, 12) from which several versions of S(4, 5, 11), the system for M11, can be computed. 12.6(a) Simple Groups of Order less than 106 The table below and the notes on the following five pages lists the basic facts concerning the non-Abelian simple groups of order less than 106. Further details are given in the Atlas (1985), note that some of the most interesting and important groups, for example the Mathieu group M24, have orders in excess of 108 and in many cases considerably more. Simple Order Prime Schur Outer Min Simple Order Prime Schur Outer Min group factor multi. auto. simple or group factor multi. auto. simple or count group group N-group count group group N-group ? A5 60 4 C2 C2 m-s L2(73) 194472 7 C2 C2 m-s ? 2 A6 360 6 C6 C2 N-g L2(79) 246480 8 C2 C2 N-g A7 2520 7 C6 C2 N-g L2(64) 262080 11 hei C6 N-g ? A8 20160 10 C2 C2 - L2(81) 265680 10 C2 C2 × C4 N-g A9 181440 12 C2 C2 - L2(83) 285852 6 C2 C2 m-s ? L2(4) 60 4 C2 C2 m-s L2(89) 352440 8 C2 C2 N-g ? L2(5) 60 4 C2 C2 m-s L2(97) 456288 9 C2 C2 m-s ? L2(7) 168 5 C2 C2 m-s L2(101) 515100 7 C2 C2 N-g ? 2 L2(9) 360 6 C6 C2 N-g L2(103) 546312 7 C2 C2 m-s L2(8) 504 6 C2 C3 m-s -
The Mathieu Groups (Simple Sporadic Symmetries)
The Mathieu Groups (Simple Sporadic Symmetries) Scott Harper (University of St Andrews) Tomorrow's Mathematicians Today 21st February 2015 Scott Harper The Mathieu Groups 21st February 2015 1 / 15 The Mathieu Groups (Simple Sporadic Symmetries) Scott Harper (University of St Andrews) Tomorrow's Mathematicians Today 21st February 2015 Scott Harper The Mathieu Groups 21st February 2015 2 / 15 1 2 A symmetry is a structure preserving permutation of the underlying set. A group acts faithfully on an object if it is isomorphic to a subgroup of the 4 3 symmetry group of the object. Symmetry group: D4 The stabiliser of a point in a group G is Group of rotations: the subgroup of G which fixes x. ∼ h(1 2 3 4)i = C4 Subgroup fixing 1: h(2 4)i Symmetry Scott Harper The Mathieu Groups 21st February 2015 3 / 15 A symmetry is a structure preserving permutation of the underlying set. A group acts faithfully on an object if it is isomorphic to a subgroup of the symmetry group of the object. The stabiliser of a point in a group G is Group of rotations: the subgroup of G which fixes x. ∼ h(1 2 3 4)i = C4 Subgroup fixing 1: h(2 4)i Symmetry 1 2 4 3 Symmetry group: D4 Scott Harper The Mathieu Groups 21st February 2015 3 / 15 A group acts faithfully on an object if it is isomorphic to a subgroup of the symmetry group of the object. The stabiliser of a point in a group G is Group of rotations: the subgroup of G which fixes x. -
The Purpose of These Notes Is to Explain the Outer Automorphism Of
The Goal: The purpose of these notes is to explain the outer automorphism of the symmetric group S6 and its connection to the Steiner (5, 6, 12) design and the Mathieu group M12. In view of giving short proofs, we often appeal to a mixture of logic and direct computer-assisted enumerations. Preliminaries: It is an exercise to show that the symmetric group Sn ad- mits an outer automorphism if and only if n = 6. The basic idea is that any automorphism of Sn must map the set of transpositions bijectively to the set of conjugacy classes of a single permutation. A counting argument shows that the only possibility, for n =6 6, is that the automorphism maps the set of transpositions to the set of transpositions. From here it is not to hard to see that the automorphism must be an inner automorphism – i.e., conjugation by some element of Sn. For n = 6 there are 15 transpositions and also 15 triple transpositions, permutations of the form (ab)(cd)(ef) with all letters distinct. This leaves open the possibility of an outer automorphism. The Steiner Design: Let P1(Z/11) denote the projective line over Z/11. The group Γ = SL2(Z/11) consists of those transformations x → (ax + b)/(cx + d) with ad − bc ≡ 1 mod 11. There are 660 = (12 × 11 × 10)/2 elements in this group. Let B∞ = {1, 3, 4, 5, 9, ∞} ⊂ P1(Z/11) be the 6-element subset consisting of the squares mod 11 and the element ∞. Let Γ∞ ⊂ Γ be the stabilizer of B∞. -
2020 Ural Workshop on Group Theory and Combinatorics
Institute of Natural Sciences and Mathematics of the Ural Federal University named after the first President of Russia B.N.Yeltsin N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences The Ural Mathematical Center 2020 Ural Workshop on Group Theory and Combinatorics Yekaterinburg – Online, Russia, August 24-30, 2020 Abstracts Yekaterinburg 2020 2020 Ural Workshop on Group Theory and Combinatorics: Abstracts of 2020 Ural Workshop on Group Theory and Combinatorics. Yekaterinburg: N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences, 2020. DOI Editor in Chief Natalia Maslova Editors Vladislav Kabanov Anatoly Kondrat’ev Managing Editors Nikolai Minigulov Kristina Ilenko Booklet Cover Desiner Natalia Maslova c Institute of Natural Sciences and Mathematics of Ural Federal University named after the first President of Russia B.N.Yeltsin N.N. Krasovskii Institute of Mathematics and Mechanics of the Ural Branch of the Russian Academy of Sciences The Ural Mathematical Center, 2020 2020 Ural Workshop on Group Theory and Combinatorics Conents Contents Conference program 5 Plenary Talks 8 Bailey R. A., Latin cubes . 9 Cameron P. J., From de Bruijn graphs to automorphisms of the shift . 10 Gorshkov I. B., On Thompson’s conjecture for finite simple groups . 11 Ito T., The Weisfeiler–Leman stabilization revisited from the viewpoint of Terwilliger algebras . 12 Ivanov A. A., Densely embedded subgraphs in locally projective graphs . 13 Kabanov V. V., On strongly Deza graphs . 14 Khachay M. Yu., Efficient approximation of vehicle routing problems in metrics of a fixed doubling dimension . -
Polytopes Derived from Sporadic Simple Groups
Volume 5, Number 2, Pages 106{118 ISSN 1715-0868 POLYTOPES DERIVED FROM SPORADIC SIMPLE GROUPS MICHAEL I. HARTLEY AND ALEXANDER HULPKE Abstract. In this article, certain of the sporadic simple groups are analysed, and the polytopes having these groups as automorphism groups are characterised. The sporadic groups considered include all with or- der less than 4030387201, that is, all up to and including the order of the Held group. Four of these simple groups yield no polytopes, and the highest ranked polytopes are four rank 5 polytopes each from the Higman-Sims group, and the Mathieu group M24. 1. Introduction The finite simple groups are the building blocks of finite group theory. Most fall into a few infinite families of groups, but there are 26 (or 27 if 2 0 the Tits group F4(2) is counted also) which these infinite families do not include. These sporadic simple groups range in size from the Mathieu group 53 M11 of order 7920, to the Monster group M of order approximately 8×10 . One key to the study of these groups is identifying some geometric structure on which they act. This provides intuitive insight into the structure of the group. Abstract regular polytopes are combinatorial structures that have their roots deep in geometry, and so potentially also lend themselves to this purpose. Furthermore, if a polytope is found that has a sporadic group as its automorphism group, this gives (in theory) a presentation of the sporadic group over some generating involutions. In [6], a simple algorithm was given to find all polytopes acted on by a given abstract group. -
Abstracts (PDF)
Abstracts of lectures for Banff meeting, Groups and Geometries, May 4-8, 2015 Michael Aschbacher: Quaternion fusion packets Abstract I'll discuss work on a fusion theoretic version of the so-called Clas- sical Involution Theorem for groups. The project is part of a program to simplify part of the proof of the theorem classifying the finite simple groups. Pierre-Emmanuel Caprace, Nicola Radu: A compact space of isomor- phism classes of simple locally compact automorphism groups of trees, I and II Abstract Several important families of examples of non-discrete simple locally compact groups arise as automorphism groups of trees: simple algebraic groups of rank one over local fields, Kac-Moody groups of rank two over finite fields, as well as a large number of groups initially studied by Burger and Mozes and defined by prescribing their local action in terms of a given finite permutation group. The goal of the first part of this talk is to explain that a large set of isomorphism classes of simple locally compact groups acting on a given tree can be given a compact Hausdorff topology. Several questions arise then naturally, and will be addressed in the second part of the talk: Can we describe limits of known isomorphism classes? Which isomorphism classes form isolated points? Andrew Chermak: Locally grouped spaces Abstract That the finite simple groups and the simple algebraic groups have various structural properties in common need come as no great surprise since - as we now know - all but a small number of the finite simple groups are derivable from algebraic groups. -
Final Report (PDF)
GROUPS AND GEOMETRIES Inna Capdeboscq (Warwick, UK) Martin Liebeck (Imperial College London, UK) Bernhard Muhlherr¨ (Giessen, Germany) May 3 – 8, 2015 1 Overview of the field, and recent developments As groups are just the mathematical way to investigate symmetries, it is not surprising that a significant number of problems from various areas of mathematics can be translated into specialized problems about permutation groups, linear groups, algebraic groups, and so on. In order to go about solving these problems a good understanding of the finite and algebraic groups, especially the simple ones, is necessary. Examples of this procedure can be found in questions arising from algebraic geometry, in applications to the study of algebraic curves, in communication theory, in arithmetic groups, model theory, computational algebra and random walks in Markov theory. Hence it is important to improve our understanding of groups in order to be able to answer the questions raised by all these areas of application. The research areas covered at the meeting fall into three main inter-related topics. 1.1 Fusion systems and finite simple groups The subject of fusion systems has its origins in representation theory, but it has recently become a fast growing area within group theory. The notion was originally introduced in the work of L. Puig in the late 1970s; Puig later formalized this concept and provided a category-theoretical definition of fusion systems. He was drawn to create this new tool in part because of his interest in the work of Alperin and Broue,´ and modular representation theory was its first berth. It was then used in the field of homotopy theory to derive results about the p-completed classifying spaces of finite groups. -
The Subgroup Structure of the Mathieu Group Mi2
MATHEMATICS OF COMPUTATION VOLUME 50, NUMBER 182 APRIL 1988, PAGES 595-605 The Subgroup Structure of the Mathieu Group Mi2 By Francis Buekenhout and Sarah Rees Abstract. We present a full description of the lattice of subgroups of the Mathieu group Mi2. 1. Introduction. The recently fast developing search for geometries invariant by a finite simple group G (see [1], [9], [7], [2]) makes it suitable to dispose of various portions of the subgroup lattice of G. Hence it may be interesting to determine once and for all the full subgroup lattice of G. Of course, this lattice may be too large for a useful description. It seems more realistic to look for the subgroup pattern, in which the elements are conjugacy classes of subgroups and order is provided by inclusion. Even so, the task may look too difficult for any of the sporadic groups, but the result is surprisingly elegant for groups such as Mu and Ji (see [2]) while the method of search is obviously unpleasant. Large portions of the subgroup pattern of the sporadic group Mc have been worked out by O. Diawara [5]. The purpose of the present paper is to discuss the subgroup pattern of the Mathieu group Mi2. In calculating this, some use was made of the information available in [4], [8] and [6] and of the Cayley programming language ([3]). 2. Results. It turns out that there are 147 conjugacy classes of subgroups in Mi2- We denote these classes by Ki,K2,... and list them in increasing order, somewhat as Cayley does. We take the outer automorphism group of Mi2, namely M12.2, into account as follows. -
The Character Table of a Sharply 5-Transitive Subgroup of the Alternating Group of Degree 12
International Journal of Group Theory ISSN (print): 2251-7650, ISSN (on-line): 2251-7669 www.theoryofgroups.ir Vol. x No. x (201x), pp. xx-xx. www.ui.ac.ir c 201x University of Isfahan THE CHARACTER TABLE OF A SHARPLY 5-TRANSITIVE SUBGROUP OF THE ALTERNATING GROUP OF DEGREE 12 NICK GILL AND SAM HUGHES Communicated by Abstract. We calculate the character table of a sharply 5-transitive subgroup of Alt(12), and of a sharply 4-transitive subgroup of Alt(11). Our presentation of these calculations is new because we make no reference to the sporadic simple Mathieu groups, and instead deduce the desired character tables using only the existence of the stated multiply transitive permutation representations. 1. Introduction Let Alt(n) denote the alternating group on n points. In this paper we will be interested in subgroups of Alt(n) that are sharply k-transitive, for some integer k ≥ 4. Recall that a permutation group G acting on a set Ω is sharply k-transitive if, first, G acts transitively on the set of k-tuples of distinct elements of Ω and, second, the (point-wise) stabilizer of any k-tuple of distinct elements of Ω is trivial. Notice that \1-transitivity" is the same as \transitivity". In this paper we prove the following theorem. Theorem 1.1. (1) If G is a sharply 5-transitive subgroup of Alt(12), then its character table is given by Table 1. (2) If G is a sharply 4-transitive subgroup of Alt(11), then its character table is given by Table 2. -
Finite Simple Groups and Localization
Finite simple groups and localization Jose´ L. Rodr´ıguez, Jer´ omeˆ Scherer and Jacques Thevenaz´ ∗ Abstract The purpose of this paper is to explore the concept of localization, which comes from homotopy theory, in the context of finite simple groups. We give an easy criterion for a finite simple group to be a localization of some simple subgroup and we apply it in various cases. Iterating this process allows us to connect many simple groups by a sequence of localizations. We prove that all sporadic simple groups (except possibly the Monster) and several groups of Lie type are connected to alternating groups. The question remains open whether or not there are several connected components within the family of finite simple groups. In some cases, we also consider automorphism groups and universal covering groups and we show that a localization of a finite simple group may not be simple. Introduction The concept of localization plays an important role in homotopy theory. The introduction by Bousfield of homotopical localization functors in [2] and more recently its populariza- tion by Farjoun in [7] has led to the study of localization functors in other categories. Special attention has been set on the category of groups Gr, as the effect of a homotopi- cal localization on the fundamental group is often best described by a localization functor L:Gr → Gr. A localization functor is a pair (L,η) consisting of a functor L : Gr → Gr together with a natural transformation η :Id→ L, such that L is idempotent, meaning that the two morphisms ηLG, L(ηG):LG → LLG coincide and are isomorphisms. -
Monsters and Moonshine
Monsters and Moonshine lieven le bruyn 2012 universiteit antwerpen neverendingbooks.org CONTENTS 1. Monsters :::::::::::::::::::::::::::::::::::: 4 1.1 The Scottish solids..............................4 1.2 The Scottish solids hoax...........................4 1.3 Conway’s M13 game.............................8 1.4 The 15-puzzle groupoid (1/2).........................9 1.5 The 15-puzzle groupoid (2/2)......................... 11 1.6 Conway’s M13-groupoid (1/2)........................ 14 1.7 Mathieu’s blackjack (1/3)........................... 16 1.8 Mathieu’s blackjack (2/3)........................... 18 1.9 Mathieu’s blackjack (3/3)........................... 20 1.10 Conway’s M13 groupoid (2/2)........................ 22 1.11 Olivier Messiaen and Mathieu 12 ....................... 24 1.12 Galois’ last letter............................... 26 1.13 Arnold’s trinities (1/2)............................ 28 1.14 The buckyball symmetries.......................... 32 1.15 Arnold’s trinities (2/2)............................ 37 1.16 Klein’s dessins d’enfants and the buckyball................. 39 1.17 The buckyball curve.............................. 42 1.18 The ”uninteresting” case p = 5 ........................ 45 1.19 Tetra lattices.................................. 46 1.20 Who discovered the Leech lattice (1/2).................... 47 1.21 Who discovered the Leech lattice (2/2).................... 50 1.22 Sporadic simple games............................ 53 1.23 Monstrous frustrations............................ 57 1.24 What does the monster -
The Spirit of Moonshine: Connections Between the Mathieu Groups and Modular Forms
The Spirit of Moonshine: Connections between the Mathieu Groups and Modular Forms Jeremy Booher [email protected] Adviser: Benedict Gross March 22, 2010 Submitted to the Harvard University Department of Mathematics in partial fulfillment of the requirements for the degree of A.B. in Mathematics Acknowledgements I wish to thank Dick Gross, my thesis adviser, for his wisdom and patience in helping me select a manageable piece of moonshine on which to write my thesis. It would have been very easy to pick so broad a topic it would be impossible to move beyond the superficial. Thank you also for reading and improving several drafts. I also to wish to thank Noam Elkies for being an excellent source of knowledge about Steiner systems and the Mathieu groups. Thanks also to Amanda Folsam, and Riad Masri, and Ken Ono at the Wisconsin REU in Number Theory for introducing me to the theory of modular forms and monstrous moon- shine. Thanks also to Carl Erickson and Christian Zamora Jaen for agreeing to edit the math- ematical heart of my thesis, and to Jeremy Aron-Dine and Don Larsen for giving me a non-mathematicians impression of my thesis. Finally, I thank my parents for supporting me as my path into mathematics went far from their path in life. They always were interested, they always provided food, and they always loved. Thank you also for finding Steve Munden, who showed me in high school what math is all about by teaching me to prove. moonshine 2. a. (n.) Appearance without substance; something unsubstantial or unreal; (now) esp.