Permutation Group Algorithms

Explore the fascinating world of group theory with Permutation Group Algorithms by Ákos Seress, published by Cambridge University Press in 2003. This comprehensive guide spans 274 pages and delves into the essential algorithms that have played a crucial role in proving significant results within mathematics.

This book not only covers the theoretical aspects of permutation groups but also provides practical hints for implementation, making it an invaluable resource for anyone interested in applying computational techniques to group theory. With advanced exercises included, it is perfectly suited for graduate students and researchers eager to deepen their understanding of this intricate field.

Whether you are a mathematician or a computer programmer, Permutation Group Algorithms will enhance your knowledge and skills in algorithms and group theory, paving the way for innovative applications in mathematics.