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.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Is there any clear algorithm to compute the fundamental group of complements of knots?

share|cite|improve this question
2  
What do you mean by "compute"? There is the Wirtinger presentation (en.wikipedia.org/wiki/Wirtinger_presentation) but it is unclear what information you can extract from it in general. – Qiaochu Yuan Aug 12 '12 at 2:57
    
There's also an algorithm to construct a triangulation of the complement, from which there's a standard $\pi_1$ presentation construction. – Ryan Budney Aug 12 '12 at 5:39
    
the Wirtinger presentation was what I was looking for... Thanks guys – Sam Aug 13 '12 at 20:01

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.