Fundamental Algorithms for Permutation Groups by Gregory ButlerFundamental Algorithms for Permutation Groups by Gregory Butler

Fundamental Algorithms for Permutation Groups

byGregory Butler

Paperback | November 27, 1991

Pricing and Purchase Info

$81.74 online 
$128.95 list price save 36%
Earn 409 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This is the first-ever book on computational group theory.It provides extensive and up-to-date coverage of thefundamental algorithms for permutation groups with referenceto aspects of combinatorial group theory, soluble groups,and p-groups where appropriate.The book begins with a constructive introduction to grouptheory and algorithms for computing with small groups,followed by a gradual discussion of the basic ideas of Simsfor computing with very large permutation groups, andconcludes with algorithms that use group homomorphisms, asin the computation of Sylowsubgroups. No background ingroup theory is assumed.The emphasis is on the details of the data structures andimplementation which makes the algorithms effective whenapplied to realistic problems. The algorithms are developedhand-in-hand with the theoretical and practicaljustification.All algorithms are clearly described,examples are given, exercises reinforce understanding, anddetailed bibliographical remarks explain the history andcontext of the work.Much of the later material on homomorphisms, Sylowsubgroups, and soluble permutation groups is new.
Title:Fundamental Algorithms for Permutation GroupsFormat:PaperbackDimensions:256 pagesPublished:November 27, 1991Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540549552

ISBN - 13:9783540549550

Look for similar items by category:

Reviews

Table of Contents

Group theory background.- List of elements.- Searching small groups.- Cayley graph and defining relations.- Lattice of subgroups.- Orbits and schreier vectors.- Regularity.- Primitivity.- Inductive foundation.- Backtrack search.- Base change.- Schreier-Sims method.- Complexity of the Schreier-Sims method.- Homomorphisms.- Sylow subgroups.- P-groups and soluble groups.- Soluble permutation groups.- Some other algorithms.