Finitely Presented Infinite Simple Groups
Author: Graham Higman
Publisher:
Published: 1974
Total Pages: 96
ISBN-13:
DOWNLOAD EBOOKPosts
Infinite Groups: Geometric, Combinatorial and Dynamical Aspects
Author: Laurent Bartholdi
Publisher: Springer Science & Business Media
Published: 2005-12-09
Total Pages: 432
ISBN-13: 9783764374464
DOWNLOAD EBOOKThis book offers a panorama of recent advances in the theory of infinite groups. It contains survey papers contributed by leading specialists in group theory and other areas of mathematics. Topics include amenable groups, Kaehler groups, automorphism groups of rooted trees, rigidity, C*-algebras, random walks on groups, pro-p groups, Burnside groups, parafree groups, and Fuchsian groups. The accent is put on strong connections between group theory and other areas of mathematics.
Topics in Geometric Group Theory
Author: Pierre de la Harpe
Publisher: University of Chicago Press
Published: 2000-09-15
Total Pages: 348
ISBN-13: 9780226317212
DOWNLOAD EBOOKIn this book, Pierre de la Harpe provides a concise and engaging introduction to geometric group theory, a new method for studying infinite groups via their intrinsic geometry that has played a major role in mathematics over the past two decades. A recognized expert in the field, de la Harpe adopts a hands-on approach, illustrating key concepts with numerous concrete examples. The first five chapters present basic combinatorial and geometric group theory in a unique and refreshing way, with an emphasis on finitely generated versus finitely presented groups. In the final three chapters, de la Harpe discusses new material on the growth of groups, including a detailed treatment of the "Grigorchuk group." Most sections are followed by exercises and a list of problems and complements, enhancing the book's value for students; problems range from slightly more difficult exercises to open research problems in the field. An extensive list of references directs readers to more advanced results as well as connections with other fields.
Self-Similar Groups
Author: Volodymyr Nekrashevych
Publisher: American Mathematical Soc.
Published: 2005
Total Pages: 248
ISBN-13: 0821838318
DOWNLOAD EBOOKSelf-similar groups (groups generated by automata) initially appeared as examples of groups that are easy to define but have exotic properties like nontrivial torsion, intermediate growth, etc. This book studies the self-similarity phenomenon in group theory and shows its intimate relationship with dynamical systems and more classical self-similar structures, such as fractals, Julia sets, and self-affine tilings. This connection is established through the central topics of the book, which are the notions of the iterated monodromy group and limit space. A wide variety of examples and different applications of self-similar groups to dynamical systems and vice versa are discussed. In particular, it is shown that Julia sets can be reconstructed from the respective iterated monodromy groups and that groups with exotic properties can appear not just as isolated examples, but as naturally defined iterated monodromy groups of rational functions. The book offers important, new mathematics that will open new avenues of research in group theory and dynamical systems. It is intended to be accessible to a wide readership of professional mathematicians.
Algorithms and Classification in Combinatorial Group Theory
Author: Gilbert Baumslag
Publisher: Springer Science & Business Media
Published: 2012-12-06
Total Pages: 235
ISBN-13: 1461397308
DOWNLOAD EBOOKThe papers in this volume are the result of a workshop held in January 1989 at the Mathematical Sciences Research Institute. Topics covered include decision problems, finitely presented simple groups, combinatorial geometry and homology, and automatic groups and related topics.
Finite Simple Groups
Author: Daniel Gorenstein
Publisher: Springer Science & Business Media
Published: 2013-11-27
Total Pages: 339
ISBN-13: 1468484974
DOWNLOAD EBOOKIn February 1981, the classification of the finite simple groups (Dl)* was completed,t. * representing one of the most remarkable achievements in the history or mathematics. Involving the combined efforts of several hundred mathematicians from around the world over a period of 30 years, the full proof covered something between 5,000 and 10,000 journal pages, spread over 300 to 500 individual papers. The single result that, more than any other, opened up the field and foreshadowed the vastness of the full classification proof was the celebrated theorem of Walter Feit and John Thompson in 1962, which stated that every finite group of odd order (D2) is solvable (D3)-a statement expressi ble in a single line, yet its proof required a full 255-page issue of the Pacific 10urnal of Mathematics [93]. Soon thereafter, in 1965, came the first new sporadic simple group in over 100 years, the Zvonimir Janko group 1 , to further stimulate the 1 'To make the book as self-contained as possible. we are including definitions of various terms as they occur in the text. However. in order not to disrupt the continuity of the discussion. we have placed them at the end of the Introduction. We denote these definitions by (DI). (D2), (D3). etc.
Computation with Finitely Presented Groups
Author: Charles C. Sims
Publisher: Cambridge University Press
Published: 1994-01-28
Total Pages: 624
ISBN-13: 0521432138
DOWNLOAD EBOOKResearch in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups and theoretical computer scientists will find this book useful.
The Finite Simple Groups
Author: Robert Wilson
Publisher: Springer Science & Business Media
Published: 2009-12-14
Total Pages: 310
ISBN-13: 1848009879
DOWNLOAD EBOOKThisbookisintendedasanintroductiontoallthe?nitesimplegroups.During themonumentalstruggletoclassifythe?nitesimplegroups(andindeedsince), a huge amount of information about these groups has been accumulated. Conveyingthisinformationtothenextgenerationofstudentsandresearchers, not to mention those who might wish to apply this knowledge, has become a major challenge. With the publication of the two volumes by Aschbacher and Smith [12, 13] in 2004 we can reasonably regard the proof of the Classi?cation Theorem for Finite Simple Groups (usually abbreviated CFSG) as complete. Thus it is timely to attempt an overview of all the (non-abelian) ?nite simple groups in one volume. For expository purposes it is convenient to divide them into four basic types, namely the alternating, classical, exceptional and sporadic groups. The study of alternating groups soon develops into the theory of per- tation groups, which is well served by the classic text of Wielandt [170]and more modern treatments such as the comprehensive introduction by Dixon and Mortimer [53] and more specialised texts such as that of Cameron [19].
The Classification of Finite Simple Groups
Author: Michael Aschbacher
Publisher: American Mathematical Soc.
Published: 2011
Total Pages: 362
ISBN-13: 0821853368
DOWNLOAD EBOOKProvides an outline and modern overview of the classification of the finite simple groups. It primarily covers the 'even case', where the main groups arising are Lie-type (matrix) groups over a field of characteristic 2. The book thus completes a project begun by Daniel Gorenstein's 1983 book, which outlined the classification of groups of 'noncharacteristic 2 type'.
New Horizons in pro-p Groups
Author: Marcus du Sautoy
Publisher: Springer Science & Business Media
Published: 2000-05-25
Total Pages: 444
ISBN-13: 9780817641719
DOWNLOAD EBOOKA pro-p group is the inverse limit of some system of finite p-groups, that is, of groups of prime-power order where the prime - conventionally denoted p - is fixed. Thus from one point of view, to study a pro-p group is the same as studying an infinite family of finite groups; but a pro-p group is also a compact topological group, and the compactness works its usual magic to bring 'infinite' problems down to manageable proportions. The p-adic integers appeared about a century ago, but the systematic study of pro-p groups in general is a fairly recent development. Although much has been dis covered, many avenues remain to be explored; the purpose of this book is to present a coherent account of the considerable achievements of the last several years, and to point the way forward. Thus our aim is both to stimulate research and to provide the comprehensive background on which that research must be based. The chapters cover a wide range. In order to ensure the most authoritative account, we have arranged for each chapter to be written by a leading contributor (or contributors) to the topic in question. Pro-p groups appear in several different, though sometimes overlapping, contexts.
