Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Braid Index"”.
-
The T3, T4-conjecture for links
… methods, we show all oriented links with braid index at most 5, except for possibly the link formed from the closure of (σ1σ-12 σ3σ-14σ3σ-12)3, are t3; t4 unlinkable. We extend these methods to oriented links with braid index 6 and crossing number at most 12.
-
Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability
… gene with chords produces a chord diagram. The braid index of a chord diagram can be used to measure the scope of interaction between the crossings of the chords. We augment the brute force algorithm for computing the braid index to utilize a divide and conquer strategy. Both assembly graphs and …
-
On enumeration of chord diagrams and asymptotics of Vassiliev invariants
… 6 we use the rather different approach of braiding sequences to prove exponential upper bounds for the number of Vassiliev invariants on knots with bounded braid index and arborescent knots.
-
Studying Links via Plats
… the running major title "Stabilization in the braid groups", that investigated the question of what stabilization accomplishes in Markov's theorem. One key result coming out of that sequence of papers was the discovery of a new isotopy—the exchange move—which also preserves braid index and …
-
Knots and quandles
… to calculations for the figure eight knot and braid index two knots and involving lower triangular matrix groups. The thesis is rounded out by two appendices, one giving a short table of knot quandles for knots up to six crossings and the other a computer program for computing the homomorphism …
-
Algorithms and computations in Khovanov homology
… homology. The method is applied to torus braids with 2 and 3 strands in Bar-Natan’s cobordism category. The main result reduces the Khovanov homology of an infinite family of links containing those braids to a finite set, which can be computed using existing algorithms. The result advances …