DOCSLIB.ORG

Fundamentals of Group Theory: an Advanced Approach, 1 DOI 10.1007/978-0-8176-8301-6 1, © Springer Science+Business Media, LLC 2012 2 Fundamentals of Group Theory

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Fundamentals of Group Theory: an Advanced Approach, 1 DOI 10.1007/978-0-8176-8301-6 1, © Springer Science+Business Media, LLC 2012 2 Fundamentals of Group Theory Steven Roman Fundamentals of Group Theory An Advanced Approach Steven Roman Irvine, CA USA ISBN 978-0-8176-8300-9 e-ISBN 978-0-8176-8301-6 DOI 10.1007/978-0-8176-8301-6 Springer New York Dordrecht Heidelberg London Library of Congress Control Number: 2011941115 Mathematics Subject Classification (2010): 20-01 © Springer Science+Business Media, LLC 2012 All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Birkhäuser Boston, c/o Springer Science+Business Media, LLC, 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in connection with any form of information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed is forbidden. The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject to proprietary rights. Printed on acid-free paper Birkhäuser Boston is part of Springer Science+Business Media (www.birkhauser.com) To Donna Preface This book is intended to be an advanced look at the basic theory of groups, suitable for a graduate class in group theory, part of a graduate class in abstract algebra or for independent study. It can also be read by advanced undergraduates. Indeed, I assume no specific background in group theory, but do assume some level of mathematical sophistication on the part of the reader. A look at the table of contents will reveal that the overall topic selection is more or less standard for a book on this subject. Let me at least mention a few of the perhaps less standard topics covered in the book: 1) An historical look at how Galois viewed groups. 2) The problem of whether the commutator subgroup of a group is the same as the set of commutators of the group, including an example of when this is not the case. 3) A discussion of xY-groups, in particular, a) groups in which all subgroups have a complement b) groups in which all normal subgroups have a complement c) groups in which all subgroups are direct summands d) groups in which all normal subgroups are direct summands. 4) The subnormal join property, that is, the property that the join of two subnormal subgroups is subnormal. 5) Cancellation in direct sums: A group K is cancellable in direct sums if EK¸FLßK¸LÊE¸F{{ (The symbol { represents the external direct sum.) We include a proof that any finite group is cancellable in direct sums. 6) A complete proof of the theorem of Baer that a nonabelian group K has the property that all of its subgroups are normal if and only if KœEF where E is a quaternion group, is an elementary abelian group of exponent #F and is an abelian group all of whose elements have odd order. vii viii Preface 7) A somewhat more in-depth discussion of the structure of :-groups, including the nature of conjugates in a ::-group, a proof that a -group with a unique subgroup of any order must be either cyclic (for :#) or else cyclic or generalized quaternion (for :œ#) and the nature of groups of order ::88 that have elements of order ". 8) A discussion of the Sylow subgroups of the symmetric group (in terms of wreath products). 9) An introduction to the techniques used to characterize finite simple groups. 10) Birkhoff's theorem on equational classes and relative freeness. Here are a few other remarks concerning the nature of this book. 1) I have tried to emphasize universality when discussing the isomorphism theorems, quotient groups and free groups. 2) I have introduced certain concepts, such as subnormality and chain conditions perhaps a bit earlier than in some other texts at this level, in the hopes that the reader would acclimate to these concepts earlier. 3) I have also introduced group actions early in the text (Chapter 4), before giving a more thorough discussion in Chapter 7. 4) I have emphasized the role of applying certain operations, namely intersection, lifting, quotient and unquotient to a “group extension” LŸK. A couple of random notes: Unless otherwise indicated, any theorem not proved in the text is an invitation to the reader to supply a proof. Also, sections marked with an asterisk are optional, meaning that they can be skipped without missing information that will be required later. Let me conclude by thanking my graduate students of the past five years, who not only put up with this material in manuscript form but also put up with the many last-minute changes that I made to the manuscript during those years. In any case, if the reader should find any errors, I would appreciate a heads-up. I can be contacted through my web site www.romanpress.com. Steven Roman Contents Preface, vii 1 Preliminaries, 1 Multisets, 1 Words, 1 Partially Ordered Sets, 2 Chain Conditions and Finiteness, 5 Lattices, 8 Equivalence Relations, 10 Cardinality, 12 Miscellanea, 15 2 Groups and Subgroups, 19 Operations on Sets, 19 Groups, 19 The Order of a Product, 26 Orders and Exponents, 28 Conjugation, 29 The Set Product, 31 Subgroups, 32 Finitely-Generated Groups, 35 The Lattice of Subgroups of a Group, 37 Cosets and Lagrange's Theorem, 41 Euler's Formula, 43 Cyclic Groups, 44 Homomorphisms of Groups, 46 More Groups, 46 *An Historical Perspective: Galois-Style Groups, 56 Exercises, 58 3 Cosets, Index and Normal Subgroups, 61 Cosets and Index, 61 Quotient Groups and Normal Subgroups, 65 Internal Direct Products, 72 Chain Conditions and Subnormality, 76 ix x Contents Subgroups of Index #, 78 Cauchy's Theorem, 79 The Center of a Group; Centralizers, 81 The Normalizer of a Subgroup, 82 Simple Groups, 84 Commutators of Elements, 84 Commutators of Subgroups, 93 *Multivariable Commutators, 95 Exercises, 98 4 Homomorphisms, Chain Conditions and Subnormality, 105 Homomorphisms, 105 Kernels and the Natural Projection, 108 Groups of Small Order, 108 A Universal Property and the Isomorphism Theorems, 110 The Correspondence Theorem, 113 Group Extensions, 115 Inner Automorphisms, 119 Characteristic Subgroups, 120 Elementary Abelian Groups, 121 Multiplication as a Permutation, 123 The Frattini Subgroup of a Group, 127 Subnormal Subgroups, 128 Chain Conditions, 136 Automorphisms of Cyclic Groups, 141 Exercises, 144 5 Direct and Semidirect Products, 149 Complements and Essentially Disjoint Products, 149 Product Decompositions, 151 Direct Sums and Direct Products, 152 Cancellation in Direct Sums, 157 The Classification of Finite Abelian Groups, 158 Properties of Direct Summands, 161 xY-Groups, 164 Behavior Under Direct Sum, 167 When All Subgroups Are Normal, 169 Semidirect Products, 171 The External Semidirect Product, 175 *The Wreath Product, 180 Exercises, 185 6 Permutation Groups, 191 The Definition and Cycle Representation, 191 A Fundamental Formula Involving Conjugation, 193 Parity, 194 Generating Sets for WE88 and , 195 Contents xi Subgroups of WE88 and , 197 The Alternating Group Is Simple, 197 Some Counting, 200 Exercises, 202 7 Group Actions; The Structure of :-Groups, 207 Group Actions, 207 Congruence Relations on a K-Set, 211 Translation by K, 212 Conjugation by K on the Conjugates of a Subgroup, 214 Conjugation by K on a Normal Subgroup, 214 The Structure of Finite :-Groups, 215 Exercises, 229 8 Sylow Theory, 235 Sylow Subgroups, 235 The Normalizer of a Sylow Subgroup, 235 The Sylow Theorems, 236 Sylow Subgroups of Subgroups, 238 Some Consequences of the Sylow Theorems, 239 When All Sylow Subgroups Are Normal, 240 When a Subgroup Acts Transitively; The Frattini Argument, 243 The Search for Simplicity, 244 Groups of Small Order, 250 On the Existence of Complements: The Schur–Zassenhaus Theorem, 252 *Sylow Subgroups of W8, 258 Exercises, 261 9 The Classification Problem for Groups, 263 The Classification Problem for Groups, 263 The Classification Problem for Finite Simple Groups, 263 Exercises, 271 10 Finiteness Conditions, 273 Groups with Operators, 273 HH-Series and -Subnormality, 276 Composition Series, 278 The Remak Decomposition, 282 Exercises, 288 11 Solvable and Nilpotent Groups, 291 Classes of Groups, 291 Operations on Series, 293 Closure Properties of Groups Defined by Series, 295 Nilpotent Groups, 297 Solvability, 305 Exercises, 313 xii Contents 12 Free Groups and Presentations, 319 Free Groups, 319 Relatively Free Groups, 326 Presentations of a Group, 336 Exercises, 350 13 Abelian Groups, 353 An Abelian Group as a ™-Module, 355 The Classification of Finitely-Generated Abelian Groups, 355 Projectivity and the Right-Inverse Property, 357 Injectivity and the Left-Inverse Property, 359 Exercises, 363 References, 367 List of Symbols, 371 Index, 373 Chapter 1 Preliminaries In this chapter, we gather together some basic facts that will be useful in the text. Much of this material may already be familiar to the reader, so a light skim to set the notation may be all that is required. The chapter then can be used as a reference. Multisets The following simple concept is much more useful than its infrequent appearance would indicate. Definition Let WQW be a nonempty set. A multiset with underlying set is a set of ordered pairs QœÖÐ=ß8ѱ=−Wß8−33 3 3™ ß=Á= 3 4 for 3Á4× where ™ œ Ö"ß #ß á ×. The positive integer 83 is referred to as the multiplicity of the element =Q3 in . A multiset is finite if the underlying set is finite. The size of a finite multiset Q is the sum of the multiplicities of its elements. For example, Q œ ÖÐ+ß #Ñß Ð,ß $Ñß Ð-ß "Ñ× is a multiset with underlying set W œÖ+ß,ß-×.
Load more

Recommended publications
  • Structural Features of the Real and Rational Numbers ENCYCLOPEDIA of MATHEMATICS and ITS APPLICATIONS
    ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS FOUNDED BY G.-C. ROTA Editorial Board P. Flajolet, M. Ismail, E. Lutwak Volume 112 The Classical Fields: Structural Features of the Real and Rational Numbers ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS FOUNDING EDITOR G.-C. ROTA Editorial Board P. Flajolet, M. Ismail, E. Lutwak 40 N. White (ed.) Matroid Applications 41 S. Sakai Operator Algebras in Dynamical Systems 42 W. Hodges Basic Model Theory 43 H. Stahl and V. Totik General Orthogonal Polynomials 45 G. Da Prato and J. Zabczyk Stochastic Equations in Infinite Dimensions 46 A. Bj¨orner et al. Oriented Matroids 47 G. Edgar and L. Sucheston Stopping Times and Directed Processes 48 C. Sims Computation with Finitely Presented Groups 49 T. Palmer Banach Algebras and the General Theory of *-Algebras I 50 F. Borceux Handbook of Categorical Algebra I 51 F. Borceux Handbook of Categorical Algebra II 52 F. Borceux Handbook of Categorical Algebra III 53 V. F. Kolchin Random Graphs 54 A. Katok and B. Hasselblatt Introduction to the Modern Theory of Dynamical Systems 55 V. N. Sachkov Combinatorial Methods in Discrete Mathematics 56 V. N. Sachkov Probabilistic Methods in Discrete Mathematics 57 P. M. Cohn Skew Fields 58 R. Gardner Geometric Tomography 59 G. A. Baker, Jr., and P. Graves-Morris Pade´ Approximants, 2nd edn 60 J. Krajicek Bounded Arithmetic, Propositional Logic, and Complexity Theory 61 H. Groemer Geometric Applications of Fourier Series and Spherical Harmonics 62 H. O. Fattorini Infinite Dimensional Optimization and Control Theory 63 A. C. Thompson Minkowski Geometry 64 R. B. Bapat and T.
    [Show full text]
  • On the Structure of the Power Graph and the Enhanced Power Graph of a Group
    On the structure of the power graph and the enhanced power graph of a group Ghodratollah Aalipour Saieed Akbari School of Mathematical Science Department of Mathematical Sciences Rochester Institute of Technology (RIT) Sharif University of Technology Rochester, NY 14623, USA. Tehran, Iran. [email protected] s [email protected] Peter J. Cameron Reza Nikandish School of Mathematics and Statistics Department of Basic Sciences University of St Andrews Jundi-Shapur University of Technology St Andrews, Fife KY16 9SS, UK. Dezful, Iran. [email protected] [email protected] Farzad Shaveisi Department of Mathematics, Faculty of Science Razi University Kermanshah, Iran. [email protected] Submitted: Sep 28, 2016; Accepted: Jul 17, 2017; Published: Jul 28, 2017 Mathematics Subject Classifications: 05C25, 05C69, 20D60 Abstract Let G be a group. The power graph of G is a graph with the vertex set G, having an edge between two elements whenever one is a power of the other. We characterize nilpotent groups whose power graphs have finite independence number. For a bounded exponent group, we prove its power graph is a perfect graph and we determine its clique/chromatic number. Furthermore, it is proved that for every group G, the clique number of the power graph of G is at most countably infinite. We also measure how close the power graph is to the commuting graph by introducing a new graph which lies in between. We call this new graph the enhanced power graph. For an arbitrary pair of these three graphs we characterize finite groups for which this pair of graphs are equal.
    [Show full text]
  • Non-Cyclic Graph of a Group, E.G., the Non-Cyclic Graph of Any Non Locally Cyclic Group Is Always Connected and Its Diameter Is Less Than Or Equal to 3
    NON-CYCLIC GRAPH OF A GROUP A. Abdollahi ∗ and A. Mohammadi Hassanabadi Department of Mathematics, University of Isfahan, Isfahan 81746-73441, Iran. NON-CYCLIC GRAPH OF A GROUP Abstract. We associate a graph ΓG to a non locally cyclic group G (called the non-cyclic graph of G) as follows: take G\Cyc(G) as vertex set, where Cyc(G)= {x ∈ G | hx, yi is cyclic for all y ∈ G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph and we establish some graph theoretical properties (such as regularity) of this graph in terms of the group ones. We prove that the clique number of ΓG is finite if and only if ΓG has no infinite clique. We prove that if G is a finite nilpotent group and H is a group with ΓG =∼ ΓH and |Cyc(G)| = |Cyc(H)| = 1, then H is a finite nilpotent group. We give some examples of groups G whose non-cyclic graphs are “unique”, i.e., if ΓG =∼ ΓH for some group H, then G =∼ H. In view of these examples, we conjecture that every finite non-abelian simple group has a unique non-cyclic graph. Also we give some examples of finite non-cyclic groups G with the property that if ΓG =∼ ΓH for some group H, then |G| = |H|. These suggest the question whether the latter property holds for all finite non-cyclic groups. 1. Introduction and results arXiv:0708.2327v1 [math.GR] 17 Aug 2007 Let G be a group.
    [Show full text]
  • Review of Research Journal:International Monthly Scholarly
    Review Of ReseaRch impact factOR : 5.7631(Uif) UGc appROved JOURnal nO. 48514 issn: 2249-894X vOlUme - 7 | issUe - 12 | septembeR - 2018 __________________________________________________________________________________________________________________________ A STUDY ON CYCLIC GROUP AND ITS PROPERTIES Dr. Sheeja S. S. Guest Lecturer in Statistics, Govt. Arts and Science College, Kulathoor, Thiruvananthapuram, Kerala ABSTRACT The most important mathematicians associated with abstract algebra are Fermat, Leonhard Euler, and Carl Friedrich Gauss. Among them Gauss was establisher of many theorems associated with cyclic groups. Through this work we study about cyclic groups and various properties associated with them in a detailed manner. KEYWORDS: Subgroup, Cyclic Group, Virtually Cyclic Group, Meta Cyclic Group, Polycyclic Group. 1. INTRODUCTION In algebra, which is a broad division of Mathematics, abstract algebra is the study of algebraic structures such as groups, rings, field’s vector spaces. The branch abstract algebra get evaluated and developed in the latter half of nineteenth century. The attempts to find the solution of general polynomial equations of higher degree that resulted in the discovery of groups were the initial breakthrough in abstract algebra. Groups and groups theory is considered as the foundation of abstract algebra. Simply a group is an algebraic structure consisting of a set of elements equipped with an operation that combines any two elements to form a third element. Other algebraic structures like rings are defined on the basics of groups. Cyclic group is an important derivative of groups which is defined as the groups which are generated by a single element. 2. FUNDAMENTAL THEOREM OF CYCLIC GROUP Every subgroup of a cyclic group is cyclic.
    [Show full text]
  • Groups with Given Element Orders Introduction
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Siberian Federal University Digital Repository Journal of Siberian Federal University. Mathematics & Physics 2014, 7(2), 191–203 УДК 512.54 Groups with Given Element Orders Daria V. Lytkina∗ Siberian State University of Telecommunications and Informtaion Sciencies, Kirova, 86, Novosibirsk, 630102; Novosibirsk State University, Pirogova, 2, Novosibirsk, 630090 Russia Victor D. Mazurov† Sobolev Institute of Mathematics, Prospekt Akad. Koptyuga, 4, Novosibirsk, 630090 Russia Received 25.12.2013, received in revised form 04.02.2014, accepted 20.02.2014 This paper is a survey of some results and open problems about the structure of (mostly infinite) periodic groups with a given set of element orders. It is based on a talk of authors given on the conference "Algebra and Logic: Theory and Application" dedicated to the 80-th anniversary of V. P. Shunkov (Krasnoyarsk, July 21–27, 2013). Keywords: spectrum, exponent, periodic group, locally finite group. To the memory of Vladimir Petrovich Shunkov Introduction In late October 1900, William Burnside wrote a letter to Robert Fricke which contained in particular the following lines: "I take the opportunity of asking you, whether the following question has ever presented itself to you; and if it has, whether you have come to any conclusion about it. Can a group, generated by a finite number of operations, and such that the order of every one of its operations is finite and less than an assigned integer, consist of an infinite number of operations. E.g. as a very particular case: If S1 & S2 are operations, and if Σ, representing in turn a b c e m any and every combination or repetition of S1 & S2, such as S1 S2S1...S2, is such that Σ = 1, where m is a given integer, is the group generated by S1 & S2 a group of finite order or not.
    [Show full text]
  • 012-Stonehewer 165..188
    REND.SEM.MAT.UNIV.PADOVA, Vol. 115 2006) Cyclic Quasinormal Subgroups of Arbitrary Groups *). STEWART E. STONEHEWER **) - GIOVANNI ZACHER ***) To Professor Guido Zappa on his 90th birthday ABSTRACT - In recent years several papers have appeared showing how cyclic quasinormal subgroups are embedded in finite groups and many structure theorems have been proved. The purpose of the present work is twofold. First we show that, without exception, all of these theorems remain valid for finite cyclic quasinormal subgroups of infinite groups. Secondly we obtain analogous results for infinite cyclic quasinormal subgroups, where the statements turn out to be even stronger. 1. Introduction and statement of results. Let A be a cyclic quasinormal subgroup of a group G. Thus for every subgroup X of G, AX XA hA; Xi. When G is finite, then the structure of the normal closure AG of A in G is quite well understood. If A has odd order, then [A; G] is abelian and A acts on it by conjugation as a group of power automorphisms [2]). When A has even order, then [A; G] is nilpo- tent of class at most 2. When dihedral actions are excluded in certain subgroups of products AX, where X is cyclic see below), then [A; G]0 has order at most 2 and A acts on [A; G]=[A; G]0 as power automorphisms [3]). But always [A; G; A] is abelian and A acts on it again as power auto- morphisms [4]). Many of the arguments used in obtaining these results involved in- duction on group orders; and at the time, infinite groups did not appear to be the natural setting for the work.
    [Show full text]
  • Subgroup Lattices of Groups De Gruyter Expositions in Mathematics 14
    DE GRUYTER Roland Schmidt EXPOSITIONS IN MATHEMATICS 14 Subgroup lattices of Groups de Gruyter Expositions in Mathematics 14 Editors 0. H. Kegel, Albert-Ludwigs-Universitat, Freiburg V. P. Maslov, Academy of Sciences, Moscow W. D. Neumann, The University of Melbourne, Parkville R. 0. Wells, Jr., Rice University, Houston de Gruyter Expositions in Mathematics I The Analytical and Topological Theory of Semigroups, K. H. Hofmann, J. D. Lawson, J. S. Pym (Eds.) 2Combinatorial Homotopy and 4-Dimensional Complexes, H. J. Baues 3The Stefan Problem, A. M. Meirmanov 4Finite Soluble Groups, K. Doerk, T. O. Hawkes 5The Riemann Zeta-Function, A. A. Karatsuba, S. M. Voronin 6Contact Geometry and Linear Differential Equations, V. R. Nazaikinskii, V. E. Shatalov, B. Yu. Sternin 7Infinite Dimensional Lie Superalgebras, Yu. A. Bahturin, A. A. Mikhalev, V. M. Petrogradsky, M. V. Zaicev 8Nilpotent Groups and their Automorphisms, E. I. Khukhro 9Invariant Distances and Metrics in Complex Analysis, M. Jarnicki, P. Pflug 10The Link Invariants of the Chern-Simons Field Theory, E. Guadagnini 1 I Global Affine Differential Geometry of Hypersurfaces, A.-M. Li, U. Simon, G. Zhao 12Moduli Spaces of Abelian Surfaces: Compactification, Degeneration, and Theta Functions, K. Hulek, C. Kahn, S. H. Weintraub 13 Elliptic Problems in Domains with Piecewise Smooth Boundaries, S. A. Na- zarov, B. A. Plamenevsky Subgroup Lattices of Groups by Roland Schmidt W DE G Walter de GruyterBerlin New York 1994 Author Roland Schmidt Mathematisches Seminar Universitat Kiel Ludewig-Meyn-StraBe 4 D-24098 Kiel Germany 1991 Mathematics Subject Classification: 20-01, 20-02 Keywords: Group, lattice, subgroup lattice, projectivity, duality ® Printed on acid-free paper which falls within the guidelines of the ANSI to ensure permanence and durability.
    [Show full text]
  • Bibliography
    Bibliography This is primarily a list of books where the topics are pursued further (and which were often used as sources); it is followed by a list of papers referred to in the text as well as a small selection of articles having a bearing on the text. FA refers to the sequel of this book: Further Algebra and Applications. See below. Anderson, F. W. and Fuller, K. R. (1973) Rings and Categories of Modules, Graduate Texts in Mathematics 13, Springer Verlag, Berlin. Artin, E. (1948) Galois Theory, Notre Dame Math. Lectures No.2, Notre Dame, IN. Artin, E. (1957) Geometric Algebra, Interscience, New York. Barwise, J. (ed.) (1977) Handbook of Logic, North-Holland, Amsterdam. Birkhoff, G. (1967) Lattice Theory (3rd edn), AMS, Providence, RI. Bourbaki, N. (1961-80) Algebre, Chs. 1-10, Hermann, Paris, later Masson, Paris. Bourbaki, N. (1984) Elements d'Histoire de Mathematiques, Masson, Paris. Burnside, W. (1911) Theory of Groups of Finite Order (2nd edn), Cambridge Univer- sity Press; reprinted 1955, Dover, New York. Chase, S. U., Harrison, D. K. and Rosenberg, A. (1965) Galois Theory and Cohomol­ ogy Theory of Commutative Rings, Mem. Amer. Math. Soc. 52, AMS, Providence, RI. Chevalley, C. (1951) Introduction to the Theory ofAlgebraic Functions of One Variable, No.24, AMS Colloquium Publications, Providence, RI. Cohen, P. J. (1966) Set Theory and the Continuum Hypothesis, Benjamin, New York. Cohn, P. M. (1981) Universal Algebra (2nd edn), Reidel, Dordrecht. Cohn, P. M. (1985) Free Rings and Their Relations (2nd edn), LMS Monographs No.19, Academic Press, New York. Cohn, P. M. (1991) Algebraic Numbers and Algebraic Functions, Chapman & Hall! CRC Press.
    [Show full text]
  • On the Structure of the Power Graph and the Enhanced Power Graph of a Group
    On the structure of the power graph and the enhanced power graph of a group ∗ Ghodratollah Aalipour† Saieed Akbari‡ Peter J. Cameron§ Reza Nikandish¶ Farzad Shaveisik Abstract Let G be a group. The power graph of G is a graph with the vertex set G, having an edge between two elements whenever one is a power of the other. We characterize nilpotent groups whose power graphs have finite independence num- ber. For a bounded exponent group, we prove its power graph is a perfect graph and we determine its clique/chromatic number. Furthermore, it is proved that for every group G, the clique number of the power graph of G is at most countably infinite. We also measure how close the power graph is to the commuting graph by introducing a new graph which lies in between. We call this new graph as the enhanced power graph. For an arbitrary pair of these three graphs we characterize finite groups for which this pair of graphs are equal. 1 Introduction We begin with some standard definitions from graph theory and group theory. Let G be a graph with vertex set V (G). If x ∈ V (G), then the number of vertices adjacent to x is called the degree of x, and denoted by deg(x). The distance between two vertices in a graph is the number of edges in a shortest path connecting them. The diameter of a connected graph G, denoted by diam(G), is the maximum distance arXiv:1603.04337v1 [math.CO] 14 Mar 2016 between any pair of vertices of G.
    [Show full text]
  • Ore's Theorem
    California State University, San Bernardino CSUSB ScholarWorks Theses Digitization Project John M. Pfau Library 2011 Ore's theorem Jarom Viehweg Follow this and additional works at: https://scholarworks.lib.csusb.edu/etd-project Part of the Mathematics Commons Recommended Citation Viehweg, Jarom, "Ore's theorem" (2011). Theses Digitization Project. 145. https://scholarworks.lib.csusb.edu/etd-project/145 This Thesis is brought to you for free and open access by the John M. Pfau Library at CSUSB ScholarWorks. It has been accepted for inclusion in Theses Digitization Project by an authorized administrator of CSUSB ScholarWorks. For more information, please contact [email protected]. Ore's Theorem A Thesis Presented to the Faculty of California State University, San Bernardino In Partial Fulfillment of the Requirements for the Degree Master of Arts in Mathematics by Jarom Vlehweg June 2011 Ore's Theorem A Thesis Presented to the Faculty of California State University, San Bernardino by Jarom Viehweg June 2011 Approved by: an Garjo8jrimni Date Corey Dunn, Committee Member Zahid Hasan, Committee Member Peter Williams, Chair, Charles Stanton Department of Mathematics Graduate Coordinator. Department of Mathematics Ill Abstract In elementary group theory, containment defines a partial order relation on the subgroups of a fixed group. This order relation is a lattice in the sense that it is a partially ordered set in which any two elements have a greatest lower bound and a least upper bound relative to the ordering. Lattices occur frequently in mathematics and form an extensive subject of study with a vast literature. While the subgroups of every group G always form a lattice, one might ask if every conceivable lattice is isomorphic to the subgroup lattice of some group.
    [Show full text]
  • ON a SET of NORMAL SUBGROUPS by I
    ON A SET OF NORMAL SUBGROUPS by I. D. MACDONALD (Received 4 April, 1961) 1. The commutator [a, 6] of two elements a and b in a group G satisfies the identity ab = ba\a, b~\. The subgroups we study are contained in the commutator subgroup G', which is the subgroup generated by all the commutators. The group G is covered by a well-known set of normal subgroups, namely the normal closures {g}G of the cyclic subgroups {g} in G. In a similar way one may associate a subgroup K(g) with each element g, by defining K(g) to be the subgroup generated by the commutators [g, x] as x takes all values in G. These subgroups generate G' (but do not cover G' in general), and are normal in G in consequence of the identical relation (A) l9,xY = [g,yylt holding for all g, x and y in G. (By ab we mean b~*ab) It is easy to see that {g}G = {g, K(g)}. The subgroups K(g) appear in a number of situations. For instance, it is shown in Theorem 3 of [1] that if every K(g) in G is abelian, then the commutator subgroup G" of G' lies in the centre of G and has exponent 2. Again, every K(g) is finite if and only if every ele- ment of G has just a finite number of conjugates. One part of this statement is clear, and to prove the other part suppose that every element of G has only a finite number of conjugates.
    [Show full text]
  • On the Tits Alternative for PD(3) Groups
    ANNALES DE LA FACULTÉ DES SCIENCES Mathématiques MICHEL BOILEAU AND STEVEN BOYER On the Tits alternative for PD(3) groups Tome XXVIII, no 3 (2019), p. 397-415. <http://afst.cedram.org/item?id=AFST_2019_6_28_3_397_0> © Université Paul Sabatier, Toulouse, 2019, tous droits réservés. L’accès aux articles de la revue « Annales de la faculté des sci- ences de Toulouse Mathématiques » (http://afst.cedram.org/), implique l’accord avec les conditions générales d’utilisation (http://afst.cedram. org/legal/). Toute reproduction en tout ou partie de cet article sous quelque forme que ce soit pour tout usage autre que l’utilisation à fin strictement personnelle du copiste est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. cedram Article mis en ligne dans le cadre du Centre de diffusion des revues académiques de mathématiques http://www.cedram.org/ Annales de la faculté des sciences de Toulouse Volume XXVIII, no 3, 2019 pp. 397-415 On the Tits alternative for PD(3) groups Michel Boileau (1) and Steven Boyer (2) ABSTRACT.— We prove the Tits alternative for an almost coherent PD(3) group which is not virtually properly locally cyclic. In particular, we show that an almost coherent PD(3) group which cannot be generated by less than four elements always contains a rank 2 free group. RÉSUMÉ.— On montre qu’un groupe à dualité de Poincaré de dimension 3, presque cohérent et tel que tout sous-groupe d’indice fini contienne un sous-groupe propre de type fini non cyclique, vérifie l’alternative de Tits.
    [Show full text]