Item description for Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science) by Gregory Butler...
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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 9.13" Width: 6.14" Height: 0.55" Weight: 0.79 lbs.
Release Date Dec 11, 1991
ISBN 3540549552 ISBN13 9783540549550
Availability 132 units. Availability accurate as of May 22, 2017 01:35.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.
More About Gregory Butler
GREGORY S. BUTLER, Assistant Professor, Department of Government, New Mexico State University, has written a number of articles and text materials dealing with political philosophy and American political institutions and processes.
Reviews - What do customers think about Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science)?
A thorough view to permutation groups Jul 5, 2007
Written by one of the pioneers in the field, This book encompass an excellent and deep introduction to the fundamental algorithms necessary to deal with permutation groups. The algorithms are clear, concise and accurate.
Correct Apr 22, 2006
This book has a lot of pseudo-code. These are of the right detail and are correct. I used these algorithms (with my own modifications) to implement the Schreier-Sims method to solve Rubik's Cube - and found no mistakes or important "side issues" left out. This is a "computational" book, and not an introduction into Group Theory (or Permutation Groups), even though the concepts are briefly discussed.
Great book on the subject Mar 24, 2000
A very good book on algorithms for permutation groups. The author gives many references for each chapter, which are useful for further study.