The Compressed Word Problem for Groups

  • Markus Lohrey

Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)

Table of contents

  1. Front Matter
    Pages i-xii
  2. Markus Lohrey
    Pages 43-65
  3. Markus Lohrey
    Pages 67-85
  4. Markus Lohrey
    Pages 115-135
  5. Markus Lohrey
    Pages 137-138
  6. Back Matter
    Pages 139-153

About this book


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

Authors and affiliations

  • Markus Lohrey
    • 1
  1. 1.Department for Electrical Engineering and Computer ScienceUniversity of SiegenSiegenGermany

Bibliographic information