Author: Ákos Seress
Publisher: Cambridge University Press
ISBN: 9780521661034
Category : Mathematics
Languages : en
Pages : 292

Get Book Here

Book Description
Table of contents

Author: Bruce E. Sagan
Publisher: Springer Science & Business Media
ISBN: 1475768044
Category : Mathematics
Languages : en
Pages : 254

Get Book Here

Book Description
This book brings together many of the important results in this field. From the reviews: ""A classic gets even better....The edition has new material including the Novelli-Pak-Stoyanovskii bijective proof of the hook formula, Stanley’s proof of the sum of squares formula using differential posets, Fomin’s bijective proof of the sum of squares formula, group acting on posets and their use in proving unimodality, and chromatic symmetric functions." --ZENTRALBLATT MATH

Author: University of Toronto. Department of Computer Science
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages :

Get Book Here

Book Description

Author: Gregory Butler
Publisher: Springer
ISBN: 9783540549550
Category : Computers
Languages : en
Pages : 244

Get Book Here

Book Description
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: M. C. Henderson
Publisher: University of Toronto, Department of Computer Science
ISBN:
Category : Algorithms
Languages : en
Pages : 55

Get Book Here

Book Description

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

Get Book Here

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: Derek F. Holt
Publisher: CRC Press
ISBN: 1420035215
Category : Mathematics
Languages : en
Pages : 532

Get Book Here

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: Donald L. Kreher
Publisher: CRC Press
ISBN: 1000141373
Category : Computers
Languages : en
Pages : 346

Get Book Here

Book Description
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: Gene David Cooperman
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 24

Get Book Here

Book Description

Author: Helmut Wielandt
Publisher: Academic Press
ISBN: 1483258297
Category : Mathematics
Languages : en
Pages : 125

Get Book Here

Book Description
Finite Permutation Groups provides an introduction to the basic facts of both the theory of abstract finite groups and the theory of permutation groups. This book deals with older theorems on multiply transitive groups as well as on simply transitive groups. Organized into five chapters, this book begins with an overview of the fundamental concepts of notation and Frobenius group. This text then discusses the modifications of multiple transitivity and can be used to deduce an improved form of the classical theorem. Other chapters consider the concept of simply transitive permutation groups. This book discusses as well permutation groups in the framework of representation theory. The final chapter deals with Frobenius' theory of group characters. This book is a valuable resource for engineers, mathematicians, and research workers. Graduate students and readers who are interested in finite permutation groups will also find this book useful.