# The Compressed Word Problem for Groups

Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)

Advertisement

Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)

The Compressed Word Problem for Groups provides a detailed exposition of known results on the compressed word problem, emphasizing efficient algorithms for the compressed word problem in various groups. The author presents the necessary background along with the most recent results on the compressed word problem to create a cohesive self-contained book accessible to computer scientists as well as mathematicians. Readers will quickly reach the frontier of current research which makes the book especially appealing for students looking for a currently active research topic at the intersection of group theory and computer science. The word problem introduced in 1910 by Max Dehn is one of the most important decision problems in group theory. For many groups, highly efficient algorithms for the word problem exist. In recent years, a new technique based on data compression for providing more efficient algorithms for word problems, has been developed, by representing long words over group generators in a compressed form using a straight-line program. Algorithmic techniques used for manipulating compressed words has shown that the compressed word problem can be solved in polynomial time for a large class of groups such as free groups, graph groups and nilpotent groups. These results have important implications for algorithmic questions related to automorphism groups.

algorithms for groups combinatorial group theory complexity of algebraic problems straight-line programs

- DOI https://doi.org/10.1007/978-1-4939-0748-9
- Copyright Information Markus Lohrey 2014
- Publisher Name Springer, New York, NY
- eBook Packages Mathematics and Statistics
- Print ISBN 978-1-4939-0747-2
- Online ISBN 978-1-4939-0748-9
- Series Print ISSN 2191-8198
- Series Online ISSN 2191-8201
- Buy this book on publisher's site