Author : Derek F. Holt
Publisher : CRC Press
Page : 532 pages
File Size : 33,74 MB
Release : 2005-01-13
Category : Mathematics
ISBN : 1420035215
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 : N.S. Narasimha Sastry
Publisher : Springer
Page : 213 pages
File Size : 30,28 MB
Release : 2018-09-21
Category : Mathematics
ISBN : 9811320470
This book is a blend of recent developments in theoretical and computational aspects of group theory. It presents the state-of-the-art research topics in different aspects of group theory, namely, character theory, representation theory, integral group rings, the Monster simple group, computational algorithms and methods on finite groups, finite loops, periodic groups, Camina groups and generalizations, automorphisms and non-abelian tensor product of groups. Presenting a collection of invited articles by some of the leading and highly active researchers in the theory of finite groups and their representations and the Monster group, with a focus on computational aspects, this book is of particular interest to researchers in the area of group theory and related fields of mathematics.
Author : Robert H. Gilman
Publisher : American Mathematical Soc.
Page : 138 pages
File Size : 25,27 MB
Release : 2002
Category : Mathematics
ISBN : 0821831585
This book gives a nice overview of the diversity of current trends in computational and statistical group theory. It presents the latest research and a number of specific topics, such as growth, black box groups, measures on groups, product replacement algorithms, quantum automata, and more. It includes contributions by speakers at AMS Special Sessions at The University of Nevada (Las Vegas) and the Stevens Institute of Technology (Hoboken, NJ). It is suitable for graduate students and research mathematicians interested in group theory.
Author : Luise-Charlotte Kappe
Publisher : American Mathematical Soc.
Page : 210 pages
File Size : 26,42 MB
Release : 2010-04-08
Category : Mathematics
ISBN : 0821848054
This volume consists of contributions by researchers who were invited to the Harlaxton Conference on Computational Group Theory and Cohomology, held in August of 2008, and to the AMS Special Session on Computational Group Theory, held in October 2008. This volume showcases examples of how Computational Group Theory can be applied to a wide range of theoretical aspects of group theory. Among the problems studied in this book are classification of p-groups, covers of Lie groups, resolutions of Bieberbach groups, and the study of the lower central series of free groups. This volume also includes expository articles on the probabilistic zeta function of a group and on enumerating subgroups of symmetric groups. Researchers and graduate students working in all areas of Group Theory will find many examples of how Computational Group Theory helps at various stages of the research process, from developing conjectures through the verification stage. These examples will suggest to the mathematician ways to incorporate Computational Group Theory into their own research endeavors.
Author : William M. Kantor
Publisher : Walter de Gruyter
Page : 376 pages
File Size : 18,77 MB
Release : 2014-01-02
Category : Mathematics
ISBN : 3110872749
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 : Luise-Charlotte Kappe, Robert Fitzgerald Morse, Arturo Magidin
Publisher : American Mathematical Soc.
Page : 300 pages
File Size : 26,23 MB
Release : 2008-10-03
Category : Computational complexity
ISBN : 9780821857984
The power of general purpose computational algebra systems running on personal computers has increased rapidly in recent years. For mathematicians doing research in group theory, this means a growing set of sophisticated computational tools are now available for their use in developing new theoretical results. This volume consists of contributions by researchers invited to the AMS Special Session on Computational Group Theory held in March 2007. The main focus of the session was on the application of Computational Group Theory (CGT) to a wide range of theoretical aspects of group theory. The articles in this volume provide a variety of examples of how these computer systems helped to solve interesting theoretical problems within the discipline, such as constructions of finite simple groups, classification of $p$-groups via coclass, representation theory and constructions involving free nilpotent groups. The volume also includes an article by R. F. Morse highlighting applications of CGT in group theory and two survey articles. Graduate students and researchers interested in various aspects of group theory will find many examples of Computational Group Theory helping research and will recognize it as yet another tool at their disposal.
Author : Avi Wigderson
Publisher : Princeton University Press
Page : 434 pages
File Size : 45,45 MB
Release : 2019-10-29
Category : Computers
ISBN : 0691189137
An introduction to computational complexity theory, its connections and interactions with mathematics, and its central role in the natural and social sciences, technology, and philosophy Mathematics and Computation provides a broad, conceptual overview of computational complexity theory—the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory has evolved into a highly interdisciplinary field, with strong links to most mathematical areas and to a growing number of scientific endeavors. Avi Wigderson takes a sweeping survey of complexity theory, emphasizing the field’s insights and challenges. He explains the ideas and motivations leading to key models, notions, and results. In particular, he looks at algorithms and complexity, computations and proofs, randomness and interaction, quantum and arithmetic computation, and cryptography and learning, all as parts of a cohesive whole with numerous cross-influences. Wigderson illustrates the immense breadth of the field, its beauty and richness, and its diverse and growing interactions with other areas of mathematics. He ends with a comprehensive look at the theory of computation, its methodology and aspirations, and the unique and fundamental ways in which it has shaped and will further shape science, technology, and society. For further reading, an extensive bibliography is provided for all topics covered. Mathematics and Computation is useful for undergraduate and graduate students in mathematics, computer science, and related fields, as well as researchers and teachers in these fields. Many parts require little background, and serve as an invitation to newcomers seeking an introduction to the theory of computation. Comprehensive coverage of computational complexity theory, and beyond High-level, intuitive exposition, which brings conceptual clarity to this central and dynamic scientific discipline Historical accounts of the evolution and motivations of central concepts and models A broad view of the theory of computation's influence on science, technology, and society Extensive bibliography
Author : Luise-Charlotte Kappe
Publisher : American Mathematical Soc.
Page : 298 pages
File Size : 18,80 MB
Release : 2008
Category : Computers
ISBN : 0821843656
"The power of general purpose computational algebra systems running on personal computers has increased rapidly in recent years. For mathematicians doing research in group theory, this means a growing set of sophisticated computational tools are now available for their use in developing new theoretical results." "This volume consists of contributions by researchers invited to the AMS Special Session on Computational Group Theory held in March 2007. The main focus of the session was on the application of Computational Group Theory (CGT) to a wide range of theoretical aspects of group theory. The articles in this volume provide a variety of examples of how these computer systems helped to solve interesting theoretical problems within the discipline, such as constructions of finite simple groups, classification of $p$-groups via coclass, representation theory and constructions involving free nilpotent groups. The volume also includes an article by R. F. Morse highlighting applications of CGT in group theory and two survey articles." "Graduate students and researchers interested in various aspects of group theory will find many examples of Computational Group Theory helping research and will recognize it as yet another tool at their disposal."--BOOK JACKET.
Author : Paul Baginski
Publisher : World Scientific
Page : 258 pages
File Size : 10,11 MB
Release : 2017-12-26
Category : Mathematics
ISBN : 9813204060
The development of algebraic geometry over groups, geometric group theory and group-based cryptography, has led to there being a tremendous recent interest in infinite group theory. This volume presents a good collection of papers detailing areas of current interest.
Author : Charles C. Sims
Publisher : Cambridge University Press
Page : 624 pages
File Size : 22,94 MB
Release : 1994-01-28
Category : Mathematics
ISBN : 0521432138
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.
