Algorithms and Classification in Combinatorial Group Theory

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 EBOOK

The 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.


Topics in Combinatorial Group Theory

Topics in Combinatorial Group Theory

Author: Gilbert Baumslag

Publisher: Birkhäuser

Published: 2012-12-06

Total Pages: 174

ISBN-13: 3034885873

DOWNLOAD EBOOK

Combinatorial group theory is a loosely defined subject, with close connections to topology and logic. With surprising frequency, problems in a wide variety of disciplines, including differential equations, automorphic functions and geometry, have been distilled into explicit questions about groups, typically of the following kind: Are the groups in a given class finite (e.g., the Burnside problem)? Finitely generated? Finitely presented? What are the conjugates of a given element in a given group? What are the subgroups of that group? Is there an algorithm for deciding for every pair of groups in a given class whether they are isomorphic or not? The objective of combinatorial group theory is the systematic development of algebraic techniques to settle such questions. In view of the scope of the subject and the extraordinary variety of groups involved, it is not surprising that no really general theory exists. These notes, bridging the very beginning of the theory to new results and developments, are devoted to a number of topics in combinatorial group theory and serve as an introduction to the subject on the graduate level.


Combinatorial Group Theory

Combinatorial Group Theory

Author: Roger C. Lyndon

Publisher: Springer

Published: 2015-03-12

Total Pages: 354

ISBN-13: 3642618960

DOWNLOAD EBOOK

From the reviews: "This book [...] defines the boundaries of the subject now called combinatorial group theory. [...] it is a considerable achievement to have concentrated a survey of the subject into 339 pages. [...] a valuable and welcome addition to the literature, containing many results not previously available in a book. It will undoubtedly become a standard reference." Mathematical Reviews


Combinatorial Group Theory and Applications to Geometry

Combinatorial Group Theory and Applications to Geometry

Author: D.J. Collins

Publisher: Springer Science & Business Media

Published: 1998-03-17

Total Pages: 252

ISBN-13: 9783540637042

DOWNLOAD EBOOK

From the reviews: "... The book under review consists of two monographs on geometric aspects of group theory ... Together, these two articles form a wide-ranging survey of combinatorial group theory, with emphasis very much on the geometric roots of the subject. This will be a useful reference work for the expert, as well as providing an overview of the subject for the outsider or novice. Many different topics are described and explored, with the main results presented but not proved. This allows the interested reader to get the flavour of these topics without becoming bogged down in detail. Both articles give comprehensive bibliographies, so that it is possible to use this book as the starting point for a more detailed study of a particular topic of interest. ..." Bulletin of the London Mathematical Society, 1996


Classification Algorithms for Codes and Designs

Classification Algorithms for Codes and Designs

Author: Petteri Kaski

Publisher: Springer Science & Business Media

Published: 2006-02-03

Total Pages: 415

ISBN-13: 3540289917

DOWNLOAD EBOOK

A new starting-point and a new method are requisite, to insure a complete [classi?cation of the Steiner triple systems of order 15]. This method was furnished, and its tedious and di?cult execution und- taken, by Mr. Cole. F. N. Cole, L. D. Cummings, and H. S. White (1917) [129] The history of classifying combinatorial objects is as old as the history of the objects themselves. In the mid-19th century, Kirkman, Steiner, and others became the fathers of modern combinatorics, and their work – on various objects, including (what became later known as) Steiner triple systems – led to several classi?cation results. Almost a century earlier, in 1782, Euler [180] published some results on classifying small Latin squares, but for the ?rst few steps in this direction one should actually go at least as far back as ancient Greece and the proof that there are exactly ?ve Platonic solids. One of the most remarkable achievements in the early, pre-computer era is the classi?cation of the Steiner triple systems of order 15, quoted above. An onerous task that, today, no sensible person would attempt by hand calcu- tion. Because, with the exception of occasional parameters for which com- natorial arguments are e?ective (often to prove nonexistence or uniqueness), classi?cation in general is about algorithms and computation.


Combinatorial Group Theory and Topology

Combinatorial Group Theory and Topology

Author: S. M. Gersten

Publisher: Princeton University Press

Published: 1987-05-21

Total Pages: 568

ISBN-13: 9780691084107

DOWNLOAD EBOOK

Group theory and topology are closely related. The region of their interaction, combining the logical clarity of algebra with the depths of geometric intuition, is the subject of Combinatorial Group Theory and Topology. The work includes papers from a conference held in July 1984 at Alta Lodge, Utah. Contributors to the book include Roger Alperin, Hyman Bass, Max Benson, Joan S. Birman, Andrew J. Casson, Marshall Cohen, Donald J. Collins, Robert Craggs, Michael Dyer, Beno Eckmann, Stephen M. Gersten, Jane Gilman, Robert H. Gilman, Narain D. Gupta, John Hempel, James Howie, Roger Lyndon, Martin Lustig, Lee P. Neuwirth, Andrew J. Nicas, N. Patterson, John G. Ratcliffe, Frank Rimlinger, Caroline Series, John R. Stallings, C. W. Stark, and A. Royce Wolf.


Computational and Experimental Group Theory

Computational and Experimental Group Theory

Author: Alexandre Borovik

Publisher: American Mathematical Soc.

Published: 2004

Total Pages: 236

ISBN-13: 9780821856840

DOWNLOAD EBOOK

Since its origin in the early 20th century, combinatorial group theory has been primarily concerned with algorithms for solving particular problems on groups given by generators and relations: word problems, conjugacy problems, isomorphism problems, etc. Recent years have seen the focus of algorithmic group theory shift from the decidability/undecidability type of result to the complexity of algorithms. Papers in this volume reflect that paradigm shift. Articles are based on the AMS/ASL Joint Special Session, Interactions Between Logic, Group Theory and Computer Science. The volume is suitable for graduate students and research mathematicians interested in computational problems of group theory.


Combinatorial Group Theory

Combinatorial Group Theory

Author: Wilhelm Magnus

Publisher: Courier Corporation

Published: 2004-01-01

Total Pages: 466

ISBN-13: 0486438309

DOWNLOAD EBOOK

This seminal, much-cited account begins with a fairly elementary exposition of basic concepts and a discussion of factor groups and subgroups. The topics of Nielsen transformations, free and amalgamated products, and commutator calculus receive detailed treatment. The concluding chapter surveys word, conjugacy, and related problems; adjunction and embedding problems; and more. Second, revised 1976 edition.