Skip to main content
SpringerLink
Log in

The Compressed Word Problem

  • Chapter
  • First Online:
The Compressed Word Problem for Groups

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

  • 684 Accesses

Abstract

In this chapter, we introduce the main topic of this book, namely the compressed word problem for a finitely generated group. This is the variant of the word problem, where the input word is not written down explicitly, but given by an SLP. Since the input word is given in a more succinct way, the compressed word problem for a group G may have a higher computational complexity than the word problem for G, and in Sect. 4.8 we will see such a group.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    This wreath product is also called the restricted wreath product since only finitely supported mappings from G to H are considered and not all mappings.

References

  1. L. Auslander, G. Baumslag, Automorphism groups of finitely generated nilpotent groups. Bull. Amer. Math. Soc. 73, 716–717 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  2. D.A.M. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci. 38, 150–164 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  3. G. Baumslag, Wreath products and finitely presented groups. Math. Z. 79, 22–28 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  4. G. Baumslag, F.B. Cannonito, C.F. Miller III, Infinitely generated subgroups of finitely presented groups I. Math. Z. 153(2), 117–134 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Beaudry, P. McKenzie, P. Péladeau, D. Thérien, Finite monoids: from word to circuit evaluation. SIAM J. Comput. 26(1), 138–152 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Ben-Or, R. Cleve, Computing algebraic formulas using a constant number of registers. SIAM J. Comput. 21(1), 54–58 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  7. J.-C. Birget, The groups of Richard Thompson and complexity. Int. J. Algebra Comput. 14(5–6), 569–626 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. J.W. Cannon, W.J. Floyd, W.R. Parry, Introductory notes on Richard Thompson’s groups. L’Enseignement Mathématique 42(3), 215–256 (1996)

    MATH  MathSciNet  Google Scholar 

  9. W.H. Cockcroft, The word problem in a group extension. Q. J. Math. Oxford Sec. Ser. 2, 123–134 (1951)

    Article  MATH  MathSciNet  Google Scholar 

  10. R. Greenlaw, H.J. Hoover, W.L. Ruzzo, Limits to Parallel Computation: P-Completeness Theory (Oxford University Press, Oxford, 1995)

    MATH  Google Scholar 

  11. V.S. Guba, M.V. Sapir, On subgroups of R. Thompson’s group F and other diagram groups. Matematicheskii Sbornik 190(8), 3–60 (1999)

    Article  MathSciNet  Google Scholar 

  12. N. Haubold, M. Lohrey, C. Mathissen, Compressed decision problems for graph products of groups and applications to (outer) automorphism groups. Int. J. Algebra Comput. 22(8), 53 p (2013)

    Google Scholar 

  13. M.I. Kargapolov, J.I. Merzljakov, Fundamentals of the Theory of Groups. Graduate Texts in Mathematics, vol. 62 (Springer, New York, 1979)

    Google Scholar 

  14. J. Lewin, Residual properties of loops and rings. Ph.D. thesis, New York University, 1964

    Google Scholar 

  15. R.J. Lipton, Y. Zalcstein, Word problems solvable in logspace. J. Assoc. Comput. Mach. 24(3), 522–526 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  16. M. Lohrey, Word problems on compressed word. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming, ICALP 2004. Lecture Notes in Computer Science, vol. 3142 (Springer, Berlin, 2004), pp. 906–918

    Google Scholar 

  17. M. Lohrey, S. Schleimer, Efficient computation in groups via compression. In Proceedings of Computer Science in Russia, CSR 2007. Lecture Notes in Computer Science, vol. 4649 (Springer, Berlin, 2007), pp. 249–258

    Google Scholar 

  18. M. Lohrey, B. Steinberg, G. Zetzsche, Rational subsets and submonoids of wreath products. Technical Report. arXiv.org (2013), http://arxiv.org/abs/1302.2455

  19. R.C. Lyndon, P.E. Schupp, Combinatorial Group Theory (Springer, New York, 1977)

    MATH  Google Scholar 

  20. W. Magnus, On a theorem of Marshall hall. Ann. Math. Sec. Ser. 40, 764–768 (1939)

    Article  MathSciNet  Google Scholar 

  21. J. Matthews, The conjugacy problem in wreath products and free metabelian groups. Trans. Amer. Math. Soc. 121, 329–339 (1966)

    Article  MATH  MathSciNet  Google Scholar 

  22. D. Robinson, Parallel algorithms for group word problems. Ph.D. thesis, University of California, San Diego, 1993

    Google Scholar 

  23. S. Schleimer, Polynomial-time word problems. Comment. Math. Helv. 83(4), 741–765 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  24. H. Vollmer. Introduction to Circuit Complexity (Springer, New York, 1999)

    Book  Google Scholar 

  25. S. Waack, The parallel complexity of some constructions in combinatorial group theory. J. Inform. Process. Cybern. EIK 26, 265–281 (1990)

    MATH  MathSciNet  Google Scholar 

  26. B.A. Wehrfritz, On finitely generated soluble linear groups. Math. Z. 170, 155–167 (1980)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Markus Lohrey

Authors
  1. Markus Lohrey
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Markus Lohrey

About this chapter

Cite this chapter

Lohrey, M. (2014). The Compressed Word Problem. In: The Compressed Word Problem for Groups. SpringerBriefs in Mathematics. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-0748-9_4

Download citation

Publish with us

Policies and ethics

Search

Navigation