1. Conjugacy in Thompson’s Group Jim Belk (joint with Francesco Matucci)

2. Thompson’s Group Thompson’s Group  . 2 ½ 1 (¼,½)(¼,½) (½,¾)   Piecewise-linear homeomorphisms of  .   if and only if: 1. The slopes of  are powers of 2, and 2. The breakpoints of  have dyadic rational coordinates.

3. Thompson’s Group  . 2 ½ 1 (¼,½)(¼,½) (½,¾)   if and only if: 1. The slopes of  are powers of 2, and 2. The breakpoints of  have dyadic rational coordinates. 10 ½              ¼ 01 ½ ¾

4. Another Example                          

5. Another Example                          

6. Another Example                          

7. Another Example                          

8. Another Example                          

9. Another Example                          

10. Another Example                          

11. Another Example In general, a dyadic subdivision is any subdivision of  obtained by repeatedly cutting intervals in half. Every element of maps linearly between the intervals of two dyadic subdivisions.

12. Strand Diagrams

13. We represent elements of using strand diagrams: 1 0 ½              ¼ 01 ½ ¾

14. Strand Diagrams A strand diagram takes a number     (expressed in binary) as input, and outputs .  

15. Strand Diagrams A strand diagram takes a number     (expressed in binary) as input, and outputs . 

16. Strand Diagrams   A strand diagram takes a number     (expressed in binary) as input, and outputs .

17. Strand Diagrams A strand diagram takes a number     (expressed in binary) as input, and outputs .   

18. Strand Diagrams A strand diagram takes a number     (expressed in binary) as input, and outputs .    

19.  Strand Diagrams A strand diagram takes a number     (expressed in binary) as input, and outputs .    

20. Strand Diagrams Every vertex (other than the top and the bottom) is either a split or a merge: split merge

21. Strand Diagrams A split removes the first digit of a binary expansion: merge      

22.  Strand Diagrams A merge inserts a new digit:          

23. Strand Diagrams 1 0 ½              ¼ 01 ½ ¾

24. Strand Diagrams 1 0 ½              ¼ 01 ½ ¾     

25. Strand Diagrams 1 0 ½              ¼ 01 ½ ¾         

26. Strand Diagrams 1 0 ½              ¼ 01 ½ ¾       

27. Strand Diagrams

34. Reduction Type I Type II These two moves are called reductions. Neither affects the corresponding piecewise-linear function.

35. Reduction Type I Type II These two moves are called reductions. Neither affects the corresponding piecewise-linear function.   

36. Reduction Type I Type II These two moves are called reductions. Neither affects the corresponding piecewise-linear function.   

37. Reduction Type I Type II These two moves are called reductions. Neither affects the corresponding piecewise-linear function.    

38. Reduction Type I Type II These two moves are called reductions. Neither affects the corresponding piecewise-linear function.    

39. Reduction Type I Type II A strand diagram is reduced if it is not subject to any reductions. Theorem. There is a one-to-one correspondence: reduced strand diagrams elements of

40. Multiplication We can multiply two strand diagrams concatenating them:       

41. Multiplication Usually the result will not be reduced.       

42. Multiplication Usually the result will not be reduced.       

43. Multiplication Usually the result will not be reduced.       

44. Conjugacy

45. The Conjugacy Problem A solution to the conjugacy problem in  is an algorithm which decides whether given elements     are conjugate:     Let  be any group. Classical Algorithm Problems: Word Problem Conjugacy Problem Isomorphism Problem

46. The Free Group Here’s a solution to the conjugacy problem in the free group  . Suppose we are given a reduced word:           To find the conjugacy class, make the word into a circle and reduce:             

47. The Free Group To find the conjugacy class, make the word into a circle and reduce:              Two elements of   are conjugate if and only if they have the same reduced circle.

48. The Solution for The idea is to wrap the strand diagram around in a circle: We call this an annular strand diagram.

49. The Solution for The idea is to wrap the strand diagram around in a circle: We call this an annular strand diagram.

50. The Solution for The idea is to wrap the strand diagram around in a circle: We call this an annular strand diagram.

51. The Solution for The idea is to wrap the strand diagram around in a circle: We call this an annular strand diagram.

52. The Solution for The idea is to wrap the strand diagram around in a circle: We call this an annular strand diagram.

53. The Solution for The idea is to wrap the strand diagram around in a circle: We call this an annular strand diagram.

54. The Solution for The idea is to wrap the strand diagram around in a circle: We call this an annular strand diagram.

55. The Solution for The idea is to wrap the strand diagram around in a circle: We call this an annular strand diagram.

56. Main Result Theorem. Two elements of are conjugate if and only if they have the same reduced annular strand diagram.

57. Main Result Theorem (B and Matucci). Two elements of are conjugate if and only if they have the same reduced annular strand diagram. Hopcroft and Wong (1974): You can determine whether two planar graphs are isomorphic in linear time. Corollary. The conjugacy problem in has a linear-time solution. By analyzing the structure of the annular strand diagram, one can get a complete description of the dynamics of an element of.