1. Blown Away: What Knot to Do When Sailing Sir Randolph Bacon III

5. How can we tell if a knot is really knotted?

11. Theorem: Two projections represent the same knot if and only if they are related through a sequence of and only if they are related through a sequence of Reidemeister moves. Reidemeister moves.

12. ?

13. Theorem. A projection of the trivial knot with n crossings can be turned into the trivial projection in crossings can be turned into the trivial projection in no more than 2 100,000,000,000n Reidemeister moves. no more than 2 100,000,000,000n Reidemeister moves. (“The number of Reidemeister moves needed for unknotting”, Joel Hass and Jeff Lagarias, Jour. A.M.S. 14 (2001), 399-428.)

14. Theorem. A projection of the trivial knot with n crossings can be turned into the trivial projection in crossings can be turned into the trivial projection in no more than 2 100,000,000,000n Reidemeister moves. no more than 2 100,000,000,000n Reidemeister moves. (“The number of Reidemeister moves needed for unknotting”, Joel Hass and Jeff Lagarias, Jour. A.M.S. 14 (2001), 399-428.)

15. < 2 700,000,000,000 Theorem. A projection of the trivial knot with n crossings can be turned into the trivial projection in crossings can be turned into the trivial projection in no more than 2 100,000,000,000n Reidemeister moves. no more than 2 100,000,000,000n Reidemeister moves. (“The number of Reidemeister moves needed for unknotting”, Joel Hass and Jeff Lagarias, Jour. A.M.S. 14 (2001), 399-428.)

16. Tricoloration: A projection is tricolorable if its strands can be colored with three colors such that:

17. Tricoloration: A projection is tricolorable if its strands can be colored with three colors such that: 1. At each crossing, one or three colors meet. A projection is tricolorable if its strands can be colored with three colors such that: 1. At each crossing, one or three colors meet.

18. Tricoloration: A projection is tricolorable if its strands can be colored with three colors such that: 1. At each crossing, one or three colors meet. 2. At least two colors are utilized. A projection is tricolorable if its strands can be colored with three colors such that: 1. At each crossing, one or three colors meet. 2. At least two colors are utilized.

19. Examples:

20. Examples:

21. Examples:

22. Non-examples: E xamples:

23. Non-examples: E xamples:

24. Thm. A projection of a knot is tricolorable if and only if every projection of that knot is tricolorable. Pf. It is enough to show that the Reidemeister moves preserve tricolorability.

30. No tricoloration, so perhaps trivial, perhaps not!

31. 14 =2(mod12) 3 =27(mod12) 4 = -8(mod 12) 14 =2(mod12) 3 =27(mod12) 4 = -8(mod 12)

32. a=b(mod p) if p divides a-b

33. e.g. 7 = 2 (mod5) since 5 divides 7-2. a=b(mod p) if p divides a-b

34. e.g. 7 = 2 (mod5) since 5 divides 7-2. 9= 0 (mod 3) since 3 divides 9-0. e.g. 7 = 2 (mod5) since 5 divides 7-2. 9= 0 (mod 3) since 3 divides 9-0. a=b(mod p) if p divides a-b

35. e.g. 7 = 2 (mod5) since 5 divides 7-2. 9= 0 (mod 3) since 3 divides 9-0. 1=7(mod 6) since 6 divides 1-7. e.g. 7 = 2 (mod5) since 5 divides 7-2. 9= 0 (mod 3) since 3 divides 9-0. 1=7(mod 6) since 6 divides 1-7. a=b(mod p) if p divides a-b

39. Theorem. p-colorations are preserved by Reidemeister moves.

40. Corollary. If one projection of a knot is p- colorable for some p, then every projection of that knot is p-colorable. Theorem. p-colorations are preserved by Reidemeister moves. Corollary. If one projection of a knot is p- colorable for some p, then every projection of that knot is p-colorable.

41. Theorem. p-colorations are preserved by Reidemeister moves. Corollary. If one projection of a knot is p- colorable for some p, then every projection of that knot is p-colorable. Corollary. If K is p-colorable for some p ≥ 3, then K is nontrivial. Theorem. p-colorations are preserved by Reidemeister moves. Corollary. If one projection of a knot is p- colorable for some p, then every projection of that knot is p-colorable. Corollary. If K is p-colorable for some p ≥ 3, then K is nontrivial.

43. So it is nontrivial!

44. A 7-coloring So this is nontrivial!

46. 1

47. 1 2

48. 1 32

49. 1 32 4

50. 1 32 4 5

51. 1 32 6 4 5

52. 1 32 6 7 4 5

53. 1 32 8 6 7 4 5

54. 1 32 9 8 6 7 4 5

55. 1 32 9 8 6 7 10 4 5

56. 1 32 9 8 6 7 4 5 1 3 5 7 9 6 10 8 2 4

57. 1 32 9 8 6 7 10 4 5 1 3 5 7 9 6 10 8 2 46 10 8 2 4

58. 1 3 5 7 9 6 10 8 2 4

59. 1 3 5 7 9 6 10 8 2 4

60. 1 3 5 7 9 6 10 8 2 4

61. 1 3 5 7 9 6 10 8 2 4

62. 1 3 5 7 9 6 10 8 2 4

63. 1 3 5 7 9 6 10 8 2 4

64. 1 3 5 7 9 6 10 8 2 4

65. 1 3 5 7 9 6 10 8 2 4

66. 1 3 5 7 9 6 10 8 2 4

67. 1 3 5 7 9 6 10 8 2 4

68. 1 3 5 7 9 6 10 8 2 4

83. And thanks to Danny DeVito and especially Angelina Jolie.

84. And thanks to Danny DeVito and especially Angelina Jolie. Who could ever forget the champagne, the walk on the beach and the moonlit swim.

85. And thanks to Danny DeVito and especially Angelina Jolie. Who could ever forget the champagne, the walk on the beach and the moonlit swim. Just the three of us.

86. And thanks to Danny DeVito and especially Angelina Jolie. Who could ever forget the champagne, the walk on the beach and the moonlit swim. Just the three of us.