Title	When can a link be obtained from another using crossing exchanges and smoothings
Creator	Medina Graciano, Carolina
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2019-03-27T11:08
Description	Let $L$ be a fixed link. Given a link diagram $D$, is there a sequence of crossing exchanges and smoothings on $D$ that yields a diagram of $L$ We approach this problem from the computational complexity point of view. It follows from work by Endo, Itoh, and Taniyama that if $L$ is a prime link with crossing number at most five, then there is an algorithm that answers this question in polynomial time. We show that the same holds for all torus $T_{2,m}$ and all twist knots.
Extent	18.0 minutes
Subject	Mathematics; Biology and other natural sciences; Manifolds and cell complexes; Mathematical biology
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Universidad Autónoma de San Luis Potosí Inicio
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2019-09-24
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0380970
URI	http://hdl.handle.net/2429/71754
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Other
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos