Braids Without Twists Jim Belk* and Francesco Matucci.

Slides:



Advertisements
Similar presentations
Function f Function f-1 Ch. 9.4 Inverse Functions
Advertisements

Great Theoretical Ideas in Computer Science for Some.
Euler’s Identity Glaisher’s Bijection. Let be a partition of n into odd parts If you have two i-parts i+i in the partition, merge them to form a 2i-part.
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.
Forest Diagrams for Thompson’s Group Jim Belk. Associative Laws Consider the following piecewise-linear homeomorphism of  :
Special Equations : AND / OR and Quadratic Inequalities AND / OR are logic operators. AND – where two solution sets “share” common elements. - similar.
Kerry R. Sipe Aug. 1, 2007 On the Non-Orientable Genus of Zero Divisor Graphs Missouri State University REU.
Chapter 3.6 Notes: Prove Theorems about Perpendicular Lines Goal: You will find the distance between a point and a line.
Week 11 – Cop number of outerplanar graphs Dr. Anthony Bonato Ryerson University AM8002 Fall 2014.
Applied Combinatorics, 4th Ed. Alan Tucker
Tucker, Applied Combinatorics, Section 1.4, prepared by Patti Bodkin
Theorem Every planar graph is 5-colorable.
Conjugacy in Thompson’s Group Jim Belk (joint with Francesco Matucci)
Conjugacy and Dynamics in Thompson’s Groups Jim Belk (joint with Francesco Matucci)
Problem: Induced Planar Graphs Tim Hayes Mentor: Dr. Fiorini.
Problem: Induced Planar Graphs Tim Hayes Mentor: Dr. Fiorini.
Long Multiplication What is long multiplication?
CS 2813 Discrete Structures
The force on a current-carrying wire A magnetic field exerts a force on a single moving charge, so it's not surprising that it exerts a force on a current-carrying.
Parents Guide to Long Multiplication
CSNB143 – Discrete Structure Topic 9 – Graph. Learning Outcomes Student should be able to identify graphs and its components. Students should know how.
 2. Region(face) colourings  Definitions 46: A edge of the graph is called a bridge, if the edge is not in any circuit. A connected planar graph is called.
Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.
TRICKS Ankur Club. VERTICALLY AND CROSSWISE you do not need to the multiplication tables beyond 5 X 5  Suppose you need 7 x 6 = 42 7 is 3 below 10 and.
Complex Numbers in Polar Form
MAT 2720 Discrete Mathematics Section 8.7 Planar Graphs
1 12/2/2015 MATH 224 – Discrete Mathematics Formally a graph is just a collection of unordered or ordered pairs, where for example, if {a,b} G if a, b.
Graph.
Graphs!. What are graphs??? A pictorial device, such as a pie chart or bar graph, used to illustrate quantitative relationships. Also called chart.
Whole Number 5 x = 15 4 = Multiplication of Fractions
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
Chapter 9.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 6th ed., by Kenneth H.
The Miracle of Knot 1.Knot Theory 2.Tricolorability.
Introduction Sometimes, a body has simultaneously a motion of rotation and translation, such as a wheel of a car, a sphere rolling (not slipping) on the.
COMPSCI 102 Introduction to Discrete Mathematics.
Senior Project Board Implementation of the Solution to the Conjugacy Problem in Thompson’s Group F by Nabil Hossain Advisers: James Belk & Robert McGrail.
V ERTICAL AND H ORIZONTAL A SYMPTOTES. V ERTICAL A SYMPTOTES To find Vertical Asymptotes: Step1. Factor the top and bottom of the function completely.
9.3 Similar Right Triangles. Do Now: Draw the altitude and describe what it is.
Great Theoretical Ideas In Computer Science
5.9.2 Characterizations of Planar Graphs
Sample space diagrams 1. A blue and a red dice are thrown and the scores added together. (a) Complete the sample space diagram. (b) What is the probability.
Implementation of a Solution to the
Huxley’s Circle of Visual Perception
Solving Systems of Equations
Notes 7-2 The Coordinate Plane.
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Planarity and Euler’s Formula
VIDEOWALL TOOL KIT Left To Right
SLOPE.
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Notes Over 11.8 Cross Multiplying
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Polynomial Functions and Their Graphs
What comes next in this sequence
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Decision Maths Graphs.
MAT 2720 Discrete Mathematics
Mathematics Unit 45: Twisted Building
Unit 2 – Similarity, Congruence, and Proofs
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 8th ed., by Kenneth H.
Objective: Learn to compare the values of the fractions.
Question 7.
Relations and Functions
Discrete Mathematics for Computer Science
DOUBLE NUMBER LINE DIAGRAMS For example: 10 meters in 4 seconds
Dividing Complex Numbers
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Building pattern  Complete the following tables and write the rule 
Presentation transcript:

Braids Without Twists Jim Belk* and Francesco Matucci

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.

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 group B 4.

Allowed Moves ==

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

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

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

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

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

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

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

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

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

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

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

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

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

Planar Knots

If you join together the top and bottom of a braid, you get a knot. 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. Planar Knots

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

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

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

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

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

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

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

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

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

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

BV ?