Skip to main content
SpringerLink
Log in
Book cover
  • Book
  • © 2014

The Compressed Word Problem for Groups

Authors:

  1. Markus Lohrey

    1. Department for Electrical Engineering and Computer Science, University of Siegen, Siegen, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Provides a detailed introduction into an active research area in combinatorial group theory
  • Accessible to mathematicians as well as computer scientists

Part of the book series: SpringerBriefs in Mathematics (BRIEFSMATH)

Sections

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (7 chapters)

  1. Front Matter

    Pages i-xii
    PDF

  4. Algorithms on Compressed Words

    • Markus Lohrey
    Pages 43-65

  5. The Compressed Word Problem

    • Markus Lohrey
    Pages 67-85

  7. The Compressed Word Problem in HNN-Extensions

    • Markus Lohrey
    Pages 115-135

  8. Outlook

    • Markus Lohrey
    Pages 137-138

  9. Back Matter

    Pages 139-153
    PDF
Back to top

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.
Back to top

Keywords

Back to top

Authors and Affiliations

  • Department for Electrical Engineering and Computer Science, University of Siegen, Siegen, Germany

    Markus Lohrey

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Search

Navigation