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

@inproceedings{Haubold2010CompressedCA,
  title={Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups},
  author={Niko Haubold and Markus Lohrey and Christian Mathissen},
  booktitle={Developments in Language Theory},
  year={2010}
}
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. 
Compressed Decision Problems for Graph Products and Applications to (outer) Automorphism Groups
It is shown that the compressed word problem of a graph product of finitely generated groups is polynomial time Turing-reducible to the compressed word problems of the vertex groups. A direct
Algorithmics on SLP-compressed strings: A survey
TLDR
Results on algorithmic problems on strings that are given in a compressed form via straight-line programs are surveyed and applications in combinatorial group theory and computational topology and to the solution of word equations are discussed.

References

SHOWING 1-10 OF 39 REFERENCES
Efficient Computation in Groups Via Compression
TLDR
It is shown that finite extensions and free products preserve the complexity of the compressed word problem, which allows for new upper complexity bounds for the word problem for certain automorphism groups and group extensions.
Compressed Words and Automorphisms in Fully Residually Free Groups
We show that the compressed word problem in a finitely generated fully residually free group (-group) is decidable in polynomial time, and use this result to show that the word problem in the
POLYNOMIAL-TIME WORD PROBLEMS
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the
Peak reduction and finite presentations for automorphism groups of right-angled Artin groups
We generalize the peak reduction algorithm (Whitehead’s theorem) for free groups to a theorem about a general right-angled Artin group AΓ. As an application, we find a finite presentation for the
Automorphisms of graph groups
The conjugacy problem in subgroups of right‐angled Artin groups
We prove that the conjugacy problem in a large and natural class of subgroups of right‐angled Artin groups can be solved in linear time. This class of subgroups has been previously studied by Crisp
Finiteness properties of automorphism groups of right‐angled Artin groups
We study the algebraic structure of the outer automorphism group of a general right‐angled Artin group. We show that this group is virtually torsion‐free and has finite virtual cohomological
Automorphisms of 2–dimensional right-angled Artin groups
We study the outer automorphism group of a right-angled Artin group AA in the case where the defining graph A is connected and triangle-free. We give an algebraic description of Out.AA/ in terms of
The Word Problem for Free Partially Commutative Groups
An introduction to right-angled Artin groups
Recently, right-angled Artin groups have attracted much attention in geometric group theory. They have a rich structure of subgroups and nice algorithmic properties, and they give rise to cubical
...
...