The Human Knot Lucas Lembrick With: Dr. Cynthia Wyels and Maggy Tomova Capstone-Mathematics California Lutheran University Spring 2005.

Slides:



Advertisements
Similar presentations
6.896: Topics in Algorithmic Game Theory Lecture 21 Yang Cai.
Advertisements

Orthogonal Drawing Kees Visser. Overview  Introduction  Orthogonal representation  Flow network  Bend optimal drawing.
22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
22C:19 Discrete Math Graphs Fall 2014 Sukumar Ghosh.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Introduction to Graphs
Lecture 24 Coping with NPC and Unsolvable problems. When a problem is unsolvable, that's generally very bad news: it means there is no general algorithm.
Copyright © Cengage Learning. All rights reserved.
The Kauffman Bracket as an Evaluation of the Tutte Polynomial Whitney Sherman Saint Michael’s College.
To show that the Kauffman Bracket is unchanged under each of the three Reidemeister moves. First explain the basics of knot theory. Then show you what.
The Unknot, the Trefoil Knot, and the Figure-Eight Knot are Mutually Nonequivalent An Elementary Proof Jimmy Gillan Thursday, April 10, 2008.
Section 7.4: Closures of Relations Let R be a relation on a set A. We have talked about 6 properties that a relation on a set may or may not possess: reflexive,
1 Constructing Convex 3-Polytopes From Two Triangulations of a Polygon Benjamin Marlin Dept. of Mathematics & Statistics McGill University Godfried Toussaint.
Coordinates and Design.  What numbers would you write on this line?  Each space is 1 unit 0.
1 Construction of Hamiltonian Cycles in Layered Cubic Planar Graphs Graphs and Combinatorics 2002 D.S. Franzblau Department of Mathematics, CUNY/College.
Knots and Links - Introduction and Complexity Results Krishnaram Kenthapadi 11/27/2002.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set S  V(G) such that G-S has more than one component. a b c d e f g h i.
PLANE STRESS TRANSFORMATION
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set SV(G) such that S has more than one component. Connectivity of G ((G)): The.
Lower Bounds for the Ropelength of Reduced Knot Diagrams by: Robert McGuigan.
Vertex Cut Vertex Cut: A separating set or vertex cut of a graph G is a set SV(G) such that G-S has more than one component. d f b e a g c i h.
22C:19 Discrete Math Graphs Spring 2014 Sukumar Ghosh.
Game Theory.
Angles Type of angle: Acute: An Angle less than 90 degrees Right angle: An angle that is 90 degrees Obtuse angle: An angle more than 90 degrees Straight.
1.1 Chapter 1: Introduction What is the course all about? Problems, instances and algorithms Running time v.s. computational complexity General description.
Quantitative - Arithmetic - Numbers, Divisibility Test, HCF and LCM
Matthew Bowling Euler’s Theorem Mathfest Spring ‘15.
Reagan’s unit 5 math vocab
Graphs Chapter 10.
7 Graph 7.1 Even and Odd Degrees.
Coordinates and Design
Planar Graphs: Euler's Formula and Coloring Graphs & Algorithms Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
1 Excursions in Modern Mathematics Sixth Edition Peter Tannenbaum.
Part 6: Graphics Output Primitives (4) 1.  Another useful construct,besides points, straight line segments, and curves for describing components of a.
5.1  Routing Problems: planning and design of delivery routes.  Euler Circuit Problems: Type of routing problem also known as transversability problem.
Welcome to 5 th Grade “Virtual Parent School” Unit 1 Order of Operations & Whole Numbers.
Copyright © Cengage Learning. All rights reserved. CHAPTER 10 GRAPHS AND TREES.
Multiway Trees. Trees with possibly more than two branches at each node are know as Multiway trees. 1. Orchards, Trees, and Binary Trees 2. Lexicographic.
10/15/02 (c) 2002 University of Wisconsin, CS559 Last Time Clipping.
Genome Rearrangements Unoriented Blocks. Quick Review Looking at evolutionary change through reversals Find the shortest possible series of reversals.
How to Cut Pseudoparabolas into Segments Seminar on Geometric Incidences By: Almog Freizeit.
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
Discrete Mathematical Structures: Theory and Applications
EXAMPLE 1 Describe a visual pattern Describe how to sketch the fourth figure in the pattern. Then sketch the fourth figure. SOLUTION Each circle is divided.
Graphs A ‘Graph’ is a diagram that shows how things are connected together. It makes no attempt to draw actual paths or routes and scale is generally inconsequential.
Polynomial Functions Advanced Math Chapter 3. Quadratic Functions and Models Advanced Math Section 3.1.
Numerical Relationships
Vectors and the Geometry
IlliTantrix A new way of looking at knot projections Yana Malysheva, Amit Chatwani IlliMath2002.
Basic Theory (for curve 01). 1.1 Points and Vectors  Real life methods for constructing curves and surfaces often start with points and vectors, which.
The Number Line Lesson After completing this lesson, you will be able to say: I can locate a number and its opposite on a number line. I can determine.
7.G.5 ~ Find measures of angles formed by intersecting lines.
AS Decision Maths Tips for each Topic. Kruskal and Prim What examiner’s are looking for A table of values in the order that they are added and the total.
Copyright © Cengage Learning. All rights reserved. 1 Functions and Limits.
2.1 Use inductive reasoning You will describe patterns and use inductive reasoning. Essential Question: How do you use inductive reasoning in mathematics?
A Computational Approach to Knotting in Complete Graphs Dana Rowland and David Toth Merrimack College, North Andover, MA Abstract We are interested in.
Graphs. Representations of graphs : undirected graph An undirected graph G have five vertices and seven edges An adjacency-list representation of G The.
Excursions in Modern Mathematics Sixth Edition
Algorithms and Networks
Data Structures Graphs - Terminology
Applications of Angle Measurement
Mathematical problems in knot theory
MTH 392A Topics in Knot theory
Graph theory Definitions Trees, cycles, directed graphs.
Vectors and the Geometry
1 FUNCTIONS AND MODELS.
TBF Generall Mathematics - II Lecture – 8 : Linear Inequalities
Warm-UP 3/13/14  Read and Think about the following statistics. Then, answer the questions below: 10% of students in low-income communities who decide.
Presentation transcript:

The Human Knot Lucas Lembrick With: Dr. Cynthia Wyels and Maggy Tomova Capstone-Mathematics California Lutheran University Spring 2005

How to Play the Human Knot Game A group of people stand in a circle facing in.A group of people stand in a circle facing in. Everybody puts both hands in and grabs two more hands making sure not to grab the hands of somebody standing next to them.Everybody puts both hands in and grabs two more hands making sure not to grab the hands of somebody standing next to them. They now form a knot.They now form a knot. The goal is to untangle themselves until they have the unknot.The goal is to untangle themselves until they have the unknot.

Question: Does a simple set of directions exist that when given to a group of people they will always be able to form the unknot while playing the human knot game?Does a simple set of directions exist that when given to a group of people they will always be able to form the unknot while playing the human knot game?

Definitions Knot: A knot is a closed, one dimensional, and non-intersecting curve in three dimensional space. Unknot: The unknot, also known as the "trivial knot", is simply a circle embedded in three-dimensional space with no crossings. Link: A link is a group of knots or unknots embedded in three dimensional space. Each knot or unknot embedded in the link is called a component.

The Beginning It is obvious that while playing this game that the unknot is not always going to be the result. Sometimes you will get other knots and sometimes even links.It is obvious that while playing this game that the unknot is not always going to be the result. Sometimes you will get other knots and sometimes even links. At first we looked at other questions relating to our underlying goal such as:At first we looked at other questions relating to our underlying goal such as: –Is it possible to ensure a link?

Answer: Yes.Yes. Quite simply, number the participants and tell them that if they are an even number they can only hold hands with other even numbers and if they are an odd number they can only hold hands with other odds.Quite simply, number the participants and tell them that if they are an even number they can only hold hands with other even numbers and if they are an odd number they can only hold hands with other odds. This will ensure that you have a two component link, one component made up of even people and one made up of odd people.This will ensure that you have a two component link, one component made up of even people and one made up of odd people.

Next we asked: Is it possible to guarantee a knot and not a link?Next we asked: Is it possible to guarantee a knot and not a link? This is when we changed the rules of the game.This is when we changed the rules of the game. We decided to start with three people forming an unknot and then breaking their hands at one location and adding another person, thereby always forming a knot and not a link.We decided to start with three people forming an unknot and then breaking their hands at one location and adding another person, thereby always forming a knot and not a link.

How we did this We started with our three people crossing hands so they formed the attached picture where the lines are their bodies and the dots are their hands.We started with our three people crossing hands so they formed the attached picture where the lines are their bodies and the dots are their hands.

We then broke one of the hand holdings apart and added a fourth person in one of the six following ways.We then broke one of the hand holdings apart and added a fourth person in one of the six following ways.

Definitions Reidermeister Moves (RI, RII, RIII): Reidermeister Moves (RI, RII, RIII): – RI: – – – RII: – – – RIII: –

UnknotTrefoil Using Reidermeister moves we will attempt to untangle these knots

In fact, we discovered that all six pictures are isomorphic to:In fact, we discovered that all six pictures are isomorphic to: UnknotTrefoil OR

Definition Oriented: An oriented knot or link is any knot or link that has direction. The direction is referred to as the orientation and is denoted by arrows in a knot diagram.Oriented: An oriented knot or link is any knot or link that has direction. The direction is referred to as the orientation and is denoted by arrows in a knot diagram. Crossing Sign: At a crossing of an oriented knot, take the part that is an under crossing and rotate it clockwise until it is lined up with the over crossing. If the two orientations match then the crossing is said to be positive (+), if they do not match the crossing is negative (-).Crossing Sign: At a crossing of an oriented knot, take the part that is an under crossing and rotate it clockwise until it is lined up with the over crossing. If the two orientations match then the crossing is said to be positive (+), if they do not match the crossing is negative (-). + -

Question: What is the difference between the first and second picture? Moving away from the Human Knot…. if we orient the knot and give the original crossing a positive or negative value based on the orientation, then we make the new crossings in such a way that they have signs opposite to that of the original crossing, then we will have the unknot.Moving away from the Human Knot…. if we orient the knot and give the original crossing a positive or negative value based on the orientation, then we make the new crossings in such a way that they have signs opposite to that of the original crossing, then we will have the unknot.

? ? ? ? -- Orient the knots.Calculate crossing sign.Figure out crossing sign for new crossings Add fourth person according to crossing sign.The first picture is now the unknot and the second is the trefoil. UnknotTrefoil

Definitions Arc of a knot: The part of a knot in between two crossings.Arc of a knot: The part of a knot in between two crossings. Adjacent Crossings: Two crossings connected by an arc.Adjacent Crossings: Two crossings connected by an arc.

Algorithm to create unknot 1.If we number the original crossing (1) and then as we make the two new crossings numbering then (2) and (3) respectively we will have a oriented knot with numbered crossings in the order that we made them

2.Next cut your knot in any spot and thread a new piece into the knot with the following instructions: 3.When you are making a new crossing, observe the two adjacent crossings and look at the crossing sign of the lowest numbered crossing. 4.Make your new crossing the opposite sign, and number it with the next consecutive number. 5.Do this until you are ready to reconnect the knot. 6.Repeat steps 2-6

Problems This algorithm works most of the time, but for it to work all the time it will need a few modifications. When working on a proof of it I found some counterexamples to the algorithm that I believe could easily be taken care of, but then the simplicity of it is lost.This algorithm works most of the time, but for it to work all the time it will need a few modifications. When working on a proof of it I found some counterexamples to the algorithm that I believe could easily be taken care of, but then the simplicity of it is lost.

Examples of Problem Knots

Definitions Stick knot: A knot formed out of straight sticks, each one connected to another at a vertex.Stick knot: A knot formed out of straight sticks, each one connected to another at a vertex.

New Direction After meeting with Colin Adams he suggested that we look at different stick knots where the vertices of the sticks formed a circle and no two vertices adjacent on the circle were connected with a stick.After meeting with Colin Adams he suggested that we look at different stick knots where the vertices of the sticks formed a circle and no two vertices adjacent on the circle were connected with a stick.

Human Stick Knots Human Stick Knot: A stick knot inscribed in a circle such that all vertices intersect the circle and no two consecutive vertices are adjacent.Human Stick Knot: A stick knot inscribed in a circle such that all vertices intersect the circle and no two consecutive vertices are adjacent. Consecutive vertices: Two vertices on the circle where there does not exist a vertex between the two on the circle.Consecutive vertices: Two vertices on the circle where there does not exist a vertex between the two on the circle. Adjacent vertices: Two vertices connected by a stick.Adjacent vertices: Two vertices connected by a stick. A B C D E

More Definitions Stick Number (s(K)): The minimum number of sticks necessary to make a specific stick knot (K).Stick Number (s(K)): The minimum number of sticks necessary to make a specific stick knot (K). Human Stick Number (Hs(K)): The minimum number of sticks necessary to make a specific human stick knot (K).Human Stick Number (Hs(K)): The minimum number of sticks necessary to make a specific human stick knot (K).

Lemma: Instances of consecutive adjacent vertices may be reduced exactly when there exists a vertex adjacent to neither vertex in a consecutive adjacent pair. Proof: Let (v,u) be a pair of consecutive adjacent vertices and w be a vertex adjacent to neither v nor u. Then w can be places on the circle between v and u by a series of Reidermeister moves to eliminate the consecutiveness of v and u.Proof: Let (v,u) be a pair of consecutive adjacent vertices and w be a vertex adjacent to neither v nor u. Then w can be places on the circle between v and u by a series of Reidermeister moves to eliminate the consecutiveness of v and u. If no such w exists, then without loss of generality let z be adjacent to u. By placing z in between u and v, the consecutive adjacent pair (v,z) will be created.If no such w exists, then without loss of generality let z be adjacent to u. By placing z in between u and v, the consecutive adjacent pair (v,z) will be created.

A B C D E

Theorem: Hs(unknot)=5 Proof:Proof: s(unknot)=3, this is a lower bound for Hs(unkot).s(unknot)=3, this is a lower bound for Hs(unkot). Inscribe the three-stick unknot in a circle. Each pair of adjacent vertices will be consecutive.Inscribe the three-stick unknot in a circle. Each pair of adjacent vertices will be consecutive. Inscribe the four-stick unknot in a circle. At most two pairs of adjacent vertices will be non- consecutive, leaving two pairs of consecutive adjacent vertices.Inscribe the four-stick unknot in a circle. At most two pairs of adjacent vertices will be non- consecutive, leaving two pairs of consecutive adjacent vertices.

The Five-Stick Human Unknot

Question: How does Hs(k) differ from s(k) in other knots? To answer this I looked at multiple other stick knots and, using Reidermeister moves, put them in a human knot projection.To answer this I looked at multiple other stick knots and, using Reidermeister moves, put them in a human knot projection. With the exception of the unknot, all other knots I examined satisfied Hs(k)=s(k).With the exception of the unknot, all other knots I examined satisfied Hs(k)=s(k).

Conjecture: Hs(k)=s(k) for k unknot Ideas for proof:Ideas for proof: –Since the smallest s(k) for any knot other than the unknot is six (trefoil), for any two adjacent vertices, u and v, there will always exist a vertex w not adjacent to either of them. –What we were mainly working on to prove this conjecture was to place a general stick knot inside of a circle and showing that you can “pull” each vertex out to intersect the circle without disrupting the stick number.

Further Questions for Investigation Are there simple changes that can be made to the algorithm to make it work?Are there simple changes that can be made to the algorithm to make it work? Is s(K) in fact equal to Hs(K) for all knots other than the unknot?Is s(K) in fact equal to Hs(K) for all knots other than the unknot? There are 35 knots that can be formed with 10 sticks or less, if you consider a person to be five sticks, how many of these knots can actually be made with two people?There are 35 knots that can be formed with 10 sticks or less, if you consider a person to be five sticks, how many of these knots can actually be made with two people? Does a simple set of rules exist to guarantee the unknot in the human knot game?Does a simple set of rules exist to guarantee the unknot in the human knot game?

Adams, Colin. The Knot Book. N.p.: American Mathematical Society, 2004.Adams, Colin. The Knot Book. N.p.: American Mathematical Society, ‑ ‑ ‑. Personal interview. 7 Mar ‑ ‑ ‑. Personal interview. 7 Mar Foisey, Joel. “human knot.” E ‑ mail to Lucas Lembrick. 21 Oct Foisey, Joel. “human knot.” E ‑ mail to Lucas Lembrick. 21 Oct “Glossary of Terms.” Knot Theory Home Page. Thinkquest. 12 Apr “Glossary of Terms.” Knot Theory Home Page. Thinkquest. 12 Apr Payne, Bryson R. “Advanced Knot Theory Topics.” Knot Theory: The Website for learning more about knots. North Georgia College and State University. 21 Apr Payne, Bryson R. “Advanced Knot Theory Topics.” Knot Theory: The Website for learning more about knots. North Georgia College and State University. 21 Apr Rawdon, Eric J. “Equalateral Stick Number.” Knot Theory with Knot Plot. 11 Feb Center for Experimental and Constructive Mathematics. 12 Mar Rawdon, Eric J. “Equalateral Stick Number.” Knot Theory with Knot Plot. 11 Feb Center for Experimental and Constructive Mathematics. 12 Mar “Table of Knots.” Pop Math Mathematics and Knots, U.C.N.W., Bangor. 21 Apr “Table of Knots.” Pop Math Mathematics and Knots, U.C.N.W., Bangor. 21 Apr

Special Thanks Dr. Colin Adams-Williams CollegeDr. Colin Adams-Williams College Dr. Karrolyne Fogel-California Lutheran UniversityDr. Karrolyne Fogel-California Lutheran University Dr. Joel Foisy-SUNY PotsdamDr. Joel Foisy-SUNY Potsdam Maggy Tomova-UC Santa BarbaraMaggy Tomova-UC Santa Barbara Dr. Cynthia Wyels-California Lutheran UniversityDr. Cynthia Wyels-California Lutheran University