Skip to main content
SpringerLink
Log in
Book cover

International Conference on Developments in Language Theory

DLT 2010: Developments in Language Theory pp 218–230Cite as

Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups

  • Conference paper

  • 569 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6224))

Abstract

It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed form. As a consequence it follows that the word problem for the outer automorphism group of a graph group can be solved in polynomial time.

This is a preview of subscription content, 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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Charney, R.: An introduction to right-angled Artin groups. Geometriae Dedicata 125, 141–158 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cori, R., Métivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Information and Computation 106(2), 159–202 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  3. Crisp, J., Godelle, E., Wiest, B.: The conjugacy problem in right-angled Artin groups and their subgroups. Journal of Topology 2(3) (2009)

    Google Scholar 

  4. Day, M.B.: Peak reduction and finite presentations for automorphism groups of right-angled Artin groups. Geometry & Topology 13(2), 817–855 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  5. Diekert, V.: Combinatorics on Traces. LNCS, vol. 454. Springer, Heidelberg (1990)

    MATH  Google Scholar 

  6. Gasieniec, L., Karpinski, M., Plandowski, W., Rytter, W.: Efficient algorithms for Lempel-Ziv encoding. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 392–403. Springer, Heidelberg (1996)

    Google Scholar 

  7. Genest, B., Muscholl, A.: Pattern matching and membership for hierarchical message sequence charts. Theory of Computing Systems 42(4), 536–567 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hagenah, C.: Gleichungen mit regulären Randbedingungen über freien Gruppen. PhD thesis, University of Stuttgart, Institut für Informatik (2000)

    Google Scholar 

  9. Haubold, N., Lohrey, M., Mathissen, C.: Compressed conjugacy and the word problem for outer automorphism groups of graph groups (2010), http://arxiv.org/abs/1003.1233

  10. Laurence, M.R.: A generating set for the automorphism group of a graph group. Journal of the London Mathematical Society. Second Series 52(2), 318–334 (1995)

    MATH  MathSciNet  Google Scholar 

  11. Lifshits, Y.: Processing compressed texts: A tractability border. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 228–240. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  12. Liu, H.-N., Wrathall, C., Zeger, K.: Efficient solution to some problems in free partially commutative monoids. Information and Computation 89(2), 180–198 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  13. Lohrey, M., Schleimer, S.: Efficient computation in groups via compression. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) CSR 2007. LNCS, vol. 4649, pp. 249–258. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Lyndon, R.C., Schupp, P.E.: Combinatorial Group Theory. Springer, Heidelberg (1977)

    MATH  Google Scholar 

  15. Macdonald, J.: Compressed words and automorphisms in fully residually free groups. International Journal of Algebra and Computation (2009) (to appear)

    Google Scholar 

  16. Myasnikov, A., Shpilrain, V., Ushakov, A.: Group-based Cryptography. Birkhäuser, Basel (2008)

    MATH  Google Scholar 

  17. Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 460–470. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  18. Schleimer, S.: Polynomial-time word problems. Commentarii Mathematici Helvetici 83(4), 741–765 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  19. Servatius, H.: Automorphisms of graph groups. Journal of Algebra 126(1), 34–60 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  20. Wrathall, C.: The word problem for free partially commutative groups. Journal of Symbolic Computation 6(1), 99–104 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  21. Wrathall, C.: Free partially commutative groups. In: Combinatorics, Computing and Complexity, pp. 195–216. Kluwer Academic Press, Dordrecht (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Leipzig, Germany

    Niko Haubold, Markus Lohrey & Christian Mathissen

Authors
  1. Niko Haubold
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Lohrey
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Christian Mathissen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Western Ontario, N6A 5B7, London, ON, Canada

    Yuan Gao , Hanlin Lu , Shinnosuke Seki  & Sheng Yu , ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Haubold, N., Lohrey, M., Mathissen, C. (2010). Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds) Developments in Language Theory. DLT 2010. Lecture Notes in Computer Science, vol 6224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14455-4_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14455-4_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14454-7

  • Online ISBN: 978-3-642-14455-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation