Compressed conjugacy and the word problem for outer automorphism groups of graph groups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6224 LNCS, Issue , 2010, Pages 218-230

  Haubold, Niko ^a   Lohrey, Markus ^a   Mathissen, Christian ^a  

^a UNIVERSITY OF LEIPZIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMORPHISM GROUPS; CONJUGACY; POLYNOMIAL-TIME; WORD PROBLEM;

POLYNOMIAL APPROXIMATION;

EID: 78049242476     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14455-4_21     Document Type: Conference Paper

References (21)

1. Charney, R.: An introduction to right-angled Artin groups. Geometriae Dedicata 125, 141-158 (2007)
2. Cori, R., Métivier, Y., Zielonka, W.: Asynchronous mappings and asynchronous cellular automata. Information and Computation 106(2), 159-202 (1993)
3. Crisp, J., Godelle, E., Wiest, B.: The conjugacy problem in right-angled Artin groups and their subgroups. Journal of Topology 2(3) (2009)
4. Day, M. B.: Peak reduction and finite presentations for automorphism groups of right-angled Artin groups. Geometry & Topology 13(2), 817-855 (2009)
5. Diekert, V.: Combinatorics on Traces. LNCS, vol. 454. Springer, Heidelberg (1990)
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)
7. Genest, B., Muscholl, A.: Pattern matching and membership for hierarchical message sequence charts. Theory of Computing Systems 42(4), 536-567 (2008)
8. Hagenah, C.: Gleichungen mit regulären Randbedingungen über freien Gruppen. PhD thesis, University of Stuttgart, Institut für Informatik (2000)
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)
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)
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)
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)
14. Lyndon, R. C., Schupp, P. E.: Combinatorial Group Theory. Springer, Heidelberg (1977)
15. Macdonald, J.: Compressed words and automorphisms in fully residually free groups. International Journal of Algebra and Computation (2009) (to appear)
16. Myasnikov, A., Shpilrain, V., Ushakov, A.: Group-based Cryptography. Birkhäuser, Basel (2008)
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)
18. Schleimer, S.: Polynomial-time word problems. Commentarii Mathematici Helvetici 83(4), 741-765 (2008)
19. Servatius, H.: Automorphisms of graph groups. Journal of Algebra 126(1), 34-60 (1989)
20. Wrathall, C.: The word problem for free partially commutative groups. Journal of Symbolic Computation 6(1), 99-104 (1988)
21. Wrathall, C.: Free partially commutative groups. In: Combinatorics, Computing and Complexity, pp. 195-216. Kluwer Academic Press, Dordrecht (1989)