Books > Science & Mathematics > Mathematics > Combinatorics & graph theory
|
Buy Now
Fundamental Algorithms for Permutation Groups (Paperback, 1991 ed.)
Loot Price: R1,777
Discovery Miles 17 770
|
|
Fundamental Algorithms for Permutation Groups (Paperback, 1991 ed.)
Series: Lecture Notes in Computer Science, 559
Expected to ship within 10 - 15 working days
|
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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.