Computation with Finitely Presented Groups

Explore the intricate world of group theory with Computation with Finitely Presented Groups by Charles C. Sims. Published by Cambridge University Press in 2010, this comprehensive 624-page text delves into the fundamental algorithmic concepts essential for computing with finitely presented groups. Sims expertly discusses techniques for handling both infinite and non-obviously finite groups, making this book an invaluable resource for researchers and students alike. You will discover effective methods for working with elements, subgroups, and quotient groups, enhancing your understanding of combinatorial group theory and data processing. Whether you are an academic or a practitioner in the field, this work is a must-have addition to your library. Dive into the algorithms and methodologies that shape modern group theory and elevate your computational skills today!