Fundamental Algorithms for Permutation Groups (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.

Product details

• Format Paperback | 244 pages
• Dimensions 155 x 235 x 13.72mm | 800g
• Publication date 27 Nov 1991
• Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
• Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K
• Publication City/Country Berlin, Germany
• Language English
• Edition Statement 1991 ed.
• Illustrations note XII, 244 p.
• ISBN10 3540549552
• ISBN13 9783540549550

Download Fundamental Algorithms for Permutation Groups (9783540549550).pdf, available at ebookdownloadfree.co for free.

GET FREE NOW