Contact
How to shop
Delivery
Shopping guide
Fundamental Algorithms for Permutation Groups
English
163 b
30-day return policy
Customers also purchased
/
Paperback
5 676
Ft
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.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Hardback
47 293
Ft
/
Paperback
11 296
Ft
/
Paperback
3 659
Ft
/
Hardback
39 435
Ft
/
Paperback
24 244
Ft
/
Paperback
1 509
Ft
