Groups St Andrews 1989: Volume 1 PDF Download

Author: C. M. Campbell
Publisher: Cambridge University Press
ISBN: 9780521398497
Category : Mathematics
Languages : en
Pages : 268

View

Book Description
Selected papers presented at the international conference on group theory held at St. Andrews in 1989 are combined in two volumes. The themes of the conference were combinatorial and computational group theory.

Author: Gilbert Baumslag
Publisher: Springer Science & Business Media
ISBN: 1461397308
Category : Mathematics
Languages : en
Pages : 235

View

Book Description
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.

Author: John C. Lennox
Publisher: Clarendon Press
ISBN: 0191523151
Category : Mathematics
Languages : en
Pages : 360

View

Book Description
The central concept in this monograph is that of a soluble group - a group which is built up from abelian groups by repeatedly forming group extensions. It covers all the major areas, including finitely generated soluble groups, soluble groups of finite rank, modules over group rings, algorithmic problems, applications of cohomology, and finitely presented groups, whilst remaining fairly strictly within the boundaries of soluble group theory. An up-to-date survey of the area aimed at research students and academic algebraists and group theorists, it is a compendium of information that will be especially useful as a reference work for researchers in the field.

Author: Charles C. Sims
Publisher: Cambridge University Press
ISBN: 0521432138
Category : Mathematics
Languages : en
Pages : 624

View

Book Description
Research 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.

Author: William M. Kantor
Publisher: Walter de Gruyter
ISBN: 3110872749
Category : Mathematics
Languages : en
Pages : 376

View

Book Description
This volume contains contributions by the participants of the conference "Groups and Computation", which took place at The Ohio State University in Columbus, Ohio, in June 1999. This conference was the successor of two workshops on "Groups and Computation" held at DIMACS in 1991 and 1995. There are papers on permutation group algorithms, finitely presented groups, polycyclic groups, and parallel computation, providing a representative sample of the breadth of Computational Group Theory. On the other hand, more than one third of the papers deal with computations in matrix groups, giving an in-depth treatment of the currently most active area of the field. The points of view of the papers range from explicit computations to group-theoretic algorithms to group-theoretic theorems needed for algorithm development.

Author: Larry Finkelstein, William M. Kantor
Publisher: American Mathematical Soc.
ISBN: 9780821885772
Category : Algebra
Languages : en
Pages : 404

View

Book Description
The workshop "Groups and Computations" took place at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers University in June 1995. This and an earlier workshop held in October 1991 was aimed at merging theory and practice within the broad area of computation with groups. The primary goal of the previous workshop was to foster a dialogue between researchers studying the computational complexity of group algorithms and those engaged in the development of practical software. It was expected that this would lead to a deeper understanding of the mathematical issues underlying group computation and that this understanding would lead, in turn, to faster algorithms. Comments and subsequent work indicated that this goal had been achieved beyond expectations. The second workshop was designed to reinforce the progress in these directions. The scientific program consisted of invited lectures and research announcements, as well as informal discussions and software demonstrations. The eight extended talks discussed randomization, permutation groups, matrix groups, software systems, fast Fourier transforms and their applications to signal processing and data analysis, computations with finitely presented groups, and implementation and complexity questions. As in the previous workshop, speakers ranged from established researchers to graduate students.

Author: Derek F. Holt
Publisher: CRC Press
ISBN: 1420035215
Category : Mathematics
Languages : en
Pages : 532

View

Book Description
The origins of computation group theory (CGT) date back to the late 19th and early 20th centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and today it remains a lively and active branch of mathematics. The Handbook of Computational Group Theory offers the first complete treatment of all the fundame

Author: Jean-Camille Birget
Publisher: Springer Science & Business Media
ISBN: 1461213886
Category : Mathematics
Languages : en
Pages : 312

View

Book Description
This volume contains papers which are based primarily on talks given at an inter national conference on Algorithmic Problems in Groups and Semigroups held at the University of Nebraska-Lincoln from May ll-May 16, 1998. The conference coincided with the Centennial Celebration of the Department of Mathematics and Statistics at the University of Nebraska-Lincoln on the occasion of the one hun dredth anniversary of the granting of the first Ph.D. by the department. Funding was provided by the US National Science Foundation, the Department of Math ematics and Statistics, and the College of Arts and Sciences at the University of Nebraska-Lincoln, through the College's focus program in Discrete, Experimental and Applied Mathematics. The purpose of the conference was to bring together researchers with interests in algorithmic problems in group theory, semigroup theory and computer science. A particularly useful feature of this conference was that it provided a framework for exchange of ideas between the research communities in semigroup theory and group theory, and several of the papers collected here reflect this interac tion of ideas. The papers collected in this volume represent a cross section of some of the results and ideas that were discussed in the conference. They reflect a synthesis of overlapping ideas and techniques stimulated by problems concerning finite monoids, finitely presented mono ids, finitely presented groups and free groups.

Author: C. M. Campbell
Publisher: Cambridge University Press
ISBN: 9781139437219
Category : Mathematics
Languages : en
Pages : 316

View

Book Description
This first volume of the two-volume book contains selected papers from the international conference 'Groups St Andrews 2001 in Oxford' which was held at the University of Oxford in August 2001. Five main lecture courses were given at the conference, and articles based on their lectures form a substantial part of the Proceedings. This volume contains the contributions from Marston Conder (Auckland), Persi Diaconis (Stanford) and Marcus Du Sautoy (Cambridge). The series of Proceedings of Groups St Andrews conferences have provided snapshots of the state of research in group theory throughout the past twenty years. As with earlier volumes, these refereed volumes also contain accessible surveys of contemporary research fronts, as well as a diverse collection of short research articles. They form a valuable reference for researchers, especially graduate students, working in group theory.

Author: Larry Finkelstein
Publisher: American Mathematical Soc.
ISBN: 9780821870587
Category : Mathematics
Languages : en
Pages : 340

View

Book Description
This volume contains papers presented at the Workshop on Groups and Computation, held in October, 1991. The workshop explored interactions among four areas: symbolic algebra and computer algebra, theoretical computer science, group theory, and applications of group computation. The relationships between implementation and complexity form a recurrent theme, though the papers also discuss such topics as parallel algorithms for groups, computation in associative algebras, asymptotic behavior of permutation groups, the study of finite groups using infinite reflection groups, combinatorial searching, computing with representations, and Cayley graphs as models for interconnection networks.