The conjugacy problem in subgroups of right-angled Artin groups

Journal of Topology

Volumn 2, Issue 3, 2009, Pages 442-460

  Crisp, John ^a   Godelle, Eddy ^b   Wiest, Bert ^c  

^a UNIVERSITÉ DE BOURGOGNE   (France)

^b UNIVERSITÉ DE CAEN   (France)

^c UNIVERSITÉ DE RENNES 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85167514203     PISSN: 17538416     EISSN: 17538424     Source Type: Journal    
DOI: 10.1112/jtopol/jtp018     Document Type: Article

References (30)

1. A. Abrams, Configuration spaces of colored graphs, Geom. Dedicata, 2002, 92, 185–194
2. A. Abrams, R. Ghrist, Finding topology in a factory: configuration spaces, Amer. Math. Monthly, 2002, 109 (2), 140–150
3. A. Abrams, R. Ghrist, State complexes for metamorphic robots, Internat. J. Robot. Res., 2004, 23 (7-8), 809–824
4. A. V. Aho, J. E. Hopcroft, J. D. Ullman, The design and analysis of computer algorithms, 1974, London, Addison-Wesley
5. A. Baudisch, Subgroups of semifree groups, Acta Math. Acad. Sci. Hungar, 1981, 38, 19–28
6. R. S. Boyer, J. S. Moore, A fast string searching algorithm, Commun. ACM, 1977, 20 (10), 762–772
7. M. R. Bridson, A. Haefliger, Metric spaces of non-positive curvature, 1999, 319, Berlin, Springer, Springer Grundlehren Series
8. P. Cartier, D. Foata, Problèmes combinatoires de commutation et réarrangements, 1969, 85, Berlin–New York, Springer, Lecture Notes in Mathematics
9. R. Charney, An introduction to right-angled Artin groups, Geom. Dedicata, 2007, 125, 141–158
10. J. Crisp, B. Wiest, Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups, Algebr. Geom. Topol., 2004, 4, 439–472
11. J. Crisp, B. Wiest, Quasi-isometrically embedded subgroups of braid and diffeomorphism groups, Trans. Amer. Math. Soc., 2007, 359, 5485–5503
12. C. Duboc, Commutation dans les monoïdes libres, un cadre théorique pour l'étude du parallélisme, 1986, Doctoral thesis, University of Rouen, Rouen
13. D. B. A. Epstein, D. Holt, The linearity of the conjugacy problem in word-hyperbolic groups, Internat. J. Algebra Comput., 2006, 16 (2), 287–305
14. D. Farley, L. Sabalka, Discrete Morse theory and graph braid groups, Algebr. Geom. Topol., 2005, 5, 1075–1109
15. D. Farley, L. Sabalka, On the cohomology rings of tree braid groups, J. Pure Appl. Algebra, 2008, 212, 53–71
16. R. Ghrist, V. Peterson, The geometry and topology of reconfiguration, Adv. Appl. Math., 2007, 38, 302–323
17. D. Gusfield, Algorithms on strings, trees, and sequences: computer science and computational biology, 1997, Cambridge, Cambridge University Press
18. F. Haglund, D. Wise, Special cube complexes, Geom. Funct. Anal., 2008, 17 (5), 1551–1620
19. F. Haglund, D. Wise, Coxeter groups are special, 2008, Preprint
20. D. E Knuth, J. H. Morris, V. R. Pratt, Fast pattern-matching algorithms, SIAM J. Comput., 1977, 6 (2), 323–350
21. D. Krob, J. Mairesse, I. Michos, Computing the average parallelism in trace monoids, Discrete Math., 2003, 273, 131–162
22. P. Lalonde, Contribution à l'étude des empilements, 1990, Doctoral thesis, University of Quebec and Montreal, Montreal
23. H.-N. Liu, C. Wrathall, K. Zeger, Efficient solution of some problems in free partially commutative monoids, Inform. and Comput., 1990, 89, 180–198
24. G. Niblo, L. Reeves, The geometry of cube complexes and the complexity of their fundamental groups, Topology, 1998, 37, 621–633
25. L. Sabalka, Embedding right-angled Artin groups into graph braid groups, Geom. Dedicata, 2007, 124, 191–198
26. H. Servatius, Automorphisms of graph groups, J. Algebra, 1987, 126, 34–60
27. G. Stephen, String searching algorithms, 1994, River Edge, World Scientific
28. L. Van Wyk, Graph groups are biautomatic, J. Pure Appl. Algebra, 1994, 94, 341–352
29. X. Viennot, Algèbres de Lie libre et monoïdes libres, 1978, 691, Berlin, Springer, Lecture Notes in Mathematics
30. C. Wrathall, D.Z. Du, G. Hu, Free partially commutative groups, Combinatorics, computing and complexity, Norwell, MA, 1989, Kluwer Academic/Science Press