Newsletter   Secure Checkout   View Cart (0 items)  
Search:    Welcome Guest! Save up to 30-40% on most items with our awesome everyday discounts!

Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science) [Paperback]

Our Price $ 93.06  
Retail Value $ 99.00  
You Save $ 5.94  
Item Number 228748  
Buy New $93.06
Available on the Internet only.

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!

Item Specifications...

Pages   238
Est. Packaging Dimensions:   Length: 9.13" Width: 6.14" Height: 0.55"
Weight:   0.79 lbs.
Binding  Softcover
Release Date   Dec 11, 1991
Publisher   Springer
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

Register your artisan biography and upload your photo! 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.

Are You The Artisan or Author behind this product?
Improve our customers experience by registering for an Artisan Biography Center Homepage.

Product Categories

1Books > Subjects > Computers & Internet > General
2Books > Subjects > Computers & Internet > Programming > Algorithms > General
3Books > Subjects > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Discrete Mathematics
4Books > Subjects > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Group Theory
5Books > Subjects > Science > Mathematics > General
6Books > Subjects > Science > Mathematics > Pure Mathematics > Algebra > General
7Books > Subjects > Science > Mathematics > Pure Mathematics > Discrete Mathematics
8Books > Subjects > Science > Mathematics > Pure Mathematics > Group Theory

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.

Write your own review about Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science)

Ask A Question or Provide Feedback regarding Fundamental Algorithms for Permutation Groups (Lecture Notes in Computer Science)

Item Feedback and Product Questions
For immediate assistance call 888.395.0572 during the hours of 10am thru 8pm EST Monday thru Friday and a customer care representative will be happy to help you!

Help us continuously improve our service by reporting your feedback or questions below:

I have a question regarding this product
The information above is incorrect or conflicting
The page has misspellings or incorrect grammar
The page did not load correctly in my browser or created an error.

Email Address:
Anti Spam Question. To combat spammers we require that you answer a simple question.
What color is the sky?
Leave This Blank :
Do Not Change This Text :

Add This Product Widget To Your Website

Looking to add this information to your own website? Then use our Product Widget to allow you to display product information in a frame that is 120 pixels wide by 240 pixels high.

    Copy and paste the following HTML into your website and enjoy!

Order toll-free weekdays 10am thru 10pm EST by phone: 1-888-395-0572 (Lines are closed on holidays & weekends.)
Customer Service | My Account | Track My Orders | Return Policy | Request Free Catalog | Email Newsletter

Gift Certificates
RSS Feeds
About Us
Contact Us
Terms Of Use
Privacy Policy