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

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

2010-03-05

arxiv.org/abs/1003.1233v1

Mathematics

Group Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Compressed conjugacy and the word problem for outer automorphism groups of graph groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Compressed conjugacy and the word problem for outer automorphism groups of graph groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressed conjugacy and the word problem for outer automorphism groups of graph groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-687391