Braids Without Twists

1. Braids Without Twists Jim Belk* and Francesco Matucci

2. The Braid Group A braid is any picture similar to the one below. This braid has four strands, which twist around each other in a certain pattern. We can regard the strands as the paths of motion for four points moving in the plane. So a braid is really a loop in the configuration space of four points in 2.

3. The Braid Group A braid is any picture similar to the one below. We can multiply braids using vertical concatenation. Under this product, the set of all braids with four strands forms a group. This is the braid groupB4.

4. Allowed Moves = =

5. Thompson’s Group F A strand diagram is any picture similar to the one below. A strand diagram is like a braid, but it has splits and merges: split merge

6. Thompson’s Group F A strand diagram is any picture similar to the one below. A strand diagram is like a braid, but it has splits and merges: split merge

7. Allowed Moves These two moves are called reductions. They do not change the underlying strand diagram. = =

8. Multiplication We multiply strand diagrams in the same way as braids:   

9. Multiplication Usually the result will not be reduced.   

10. Multiplication Usually the result will not be reduced.   

11. Multiplication Usually the result will not be reduced.   

12. Multiplication Usually the result will not be reduced.   

13. Multiplication Usually the result will not be reduced.   

14. Multiplication Usually the result will not be reduced.   

15. Multiplication Usually the result will not be reduced. reduced   

16. Multiplication The group of all strand diagrams is called Thompson’s group F.  

17. Multiplication The group of all strand diagrams is called Thompson’s group F.  

18. Planar Knots

19. Planar Knots If you join together the top and bottom of a braid, you get a knot.

20. Planar Knots If we join together the top and bottom of a strand diagram, we get a trivalent directed graph drawn on an annulus. This is called an annular strand diagram.

21. Planar Knots We can reduce annular strand diagrams using the two allowed moves.

22. Planar Knots We can reduce annular strand diagrams using the two allowed moves.

23. Planar Knots We can reduce annular strand diagrams using the two allowed moves.

24. Planar Knots We can reduce annular strand diagrams using the two allowed moves.

25. Planar Knots We can reduce annular strand diagrams using the two allowed moves.

26. Planar Knots We can reduce annular strand diagrams using the two allowed moves.

27. Planar Knots We can reduce annular strand diagrams using the two allowed moves.

28. Theorem (Guba, Sapir, B, and Matucci). Two elements of  are conjugate if and only if they have the same reduced annular strand diagram.

29. Theorem (Guba, Sapir, B, and Matucci). Two elements of  are conjugate if and only if they have the same reduced annular strand diagram.

30. Thompson’s Group  Theorem (B and Matucci). Two elements of  are conjugate if and only if they have the same reducedtoral strand diagram.

31. Thompson’s Group  Theorem (B and Matucci). Two elements of V are conjugate if and only if they have the same reducedclosed diagram with crossings.

32. BV ?