Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

How do you find the automorphism group when given a group presentation?

share|improve this question
2  
At the level of generality at which you posed the question, you probably can't. Do you have a specific example in mind? –  Mariano Suárez-Alvarez Apr 30 '13 at 13:44
    
I do have a particular thing in mind, but it still is quite general: $<x_{1},x_{2} , \ldots , x_{n} | x_{i} = w_{i} x_{p(i)} w_{i}^{-1} , i = 1 , 2 , \ldots , n > $ where $p(1) , p(2) , \ldots , p(n) $ are a permutation of $1 , 2 , \ldots , n $ and $w_{i} (i = 1 , 2 , \ldots , n)$ are words in $x_{1} , x_{2} , \ldots , x_{n}$ which satisfy the identity $\prod_{i = 1}^{n} x_{i} = \prod_{i = 1}^{n } w_{i} x_{p(i)} w_{i}^{-1}$ in the free group $<x_{1} , x_{2} , \ldots , x_{n} >$ –  Jesse Apr 30 '13 at 13:51
2  
Given that the automorphism group is trivial iff the group is, the general problem is not decidable. –  Tobias Kildetoft Apr 30 '13 at 13:51
1  
@TobiasKildetoft ...or $C_2$... –  user1729 Apr 30 '13 at 13:51
    
@user1729 Thank you. Not sure how I forgot that. I think it still makes it undecidable. –  Tobias Kildetoft Apr 30 '13 at 13:52
show 4 more comments

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.