Author : Ákos Seress
Publisher : Cambridge University Press
Page : 292 pages
File Size : 25,64 MB
Release : 2003-03-17
Category : Mathematics
ISBN : 9780521661034
Table of contents
Author : Gregory Butler
Publisher : Springer
Page : 244 pages
File Size : 15,83 MB
Release : 1991-11-27
Category : Computers
ISBN : 9783540549550
This is the first-ever book on computational group theory. It provides extensive and up-to-date coverage of the fundamental algorithms for permutation groups with reference to aspects of combinatorial group theory, soluble groups, and p-groups where appropriate. The book begins with a constructive introduction to group theory and algorithms for computing with small groups, followed by a gradual discussion of the basic ideas of Sims for computing with very large permutation groups, and concludes with algorithms that use group homomorphisms, as in the computation of Sylowsubgroups. No background in group theory is assumed. The emphasis is on the details of the data structures and implementation which makes the algorithms effective when applied to realistic problems. The algorithms are developed hand-in-hand with the theoretical and practical justification.All algorithms are clearly described, examples are given, exercises reinforce understanding, and detailed bibliographical remarks explain the history and context of the work. Much of the later material on homomorphisms, Sylow subgroups, and soluble permutation groups is new.
Author : Gregory Butler
Publisher :
Page : 238 pages
File Size : 48,24 MB
Release : 1991
Category : Algorithms
ISBN : 9780387549552
Author : Derek F. Holt
Publisher : CRC Press
Page : 532 pages
File Size : 37,60 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 : Donald L. Kreher
Publisher : CRC Press
Page : 346 pages
File Size : 19,4 MB
Release : 1998-12-18
Category : Mathematics
ISBN : 9780849339882
This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as: Combinations Permutations Graphs Designs Many classical areas are covered as well as new research topics not included in most existing texts, such as: Group algorithms Graph isomorphism Hill-climbing Heuristic search algorithms This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.
Author : Charles C. Sims
Publisher : Cambridge University Press
Page : 624 pages
File Size : 41,7 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.
Author : Larry Finkelstein, William M. Kantor
Publisher : American Mathematical Soc.
Page : 404 pages
File Size : 48,6 MB
Release :
Category : Algebra
ISBN : 9780821885772
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 : Frank Dehne
Publisher : Springer
Page : 657 pages
File Size : 45,62 MB
Release : 2015-07-27
Category : Computers
ISBN : 3319218409
This book constitutes the refereed proceedings of the 14th Algorithms and Data Structures Symposium, WADS 2015, held in Victoria, BC, Canada, August 2015. The 54 revised full papers presented in this volume were carefully reviewed and selected from 148 submissions. The Algorithms and Data Structures Symposium - WADS (formerly Workshop on Algorithms And Data Structures), which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. WADS includes papers presenting original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
Author : Laureano Gonzalez-Vega
Publisher : Birkhäuser
Page : 407 pages
File Size : 25,95 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 3034891040
The present volume contains a selection of refereed papers from the MEGA-94 symposium held in Santander, Spain, in April 1994. They cover recent developments in the theory and practice of computation in algebraic geometry and present new applications in science and engineering, particularly computer vision and theory of robotics. The volume will be of interest to researchers working in the areas of computer algebra and symbolic computation as well as to mathematicians and computer scientists interested in gaining access to these topics.
Author : Lowell W. Beineke
Publisher : Cambridge University Press
Page : 302 pages
File Size : 14,69 MB
Release : 2004-10-04
Category : Mathematics
ISBN : 9780521801973
There is no other book with such a wide scope of both areas of algebraic graph theory.
