Deciding if a shadow resolves into a given link: linear-time algorithms
Andrea Alba, Gelasio Salazar
Abstract
A shadow (or projection) is obtained from a link diagram by ignoring the over/under information at each crossing. Given a fixed link L we investigate the complexity of deciding whether an input shadow S can be resolved into L, that is, whether we can assign over/under information to its crossings to obtain a diagram of a link isotopic to L. We show that if L∈\31,41,51,52,62,L2a1, L4a1, L5a1, L6n1\ then there exists a linear-time algorithm that decides whether an input shadow S resolves into L.
Create a lesson
Related papers
The flip symmetry on Khovanov-Rozansky homology
Hongjian Yang
Families of knots that cannot be made Legendrian parametrically
Javier Martínez-Aguinaga
Branched real projective structures on surfaces and geometrisation of representations
Gianluca Faraco, Nicholas Rungi
Generating the twist subgroup of the level 2 mapping class group of a non-orientable closed surface
Ryoma Kobayashi
H-cobordisms, infinite cyclic covers, and real Seiberg--Witten theory
Sungkyung Kang, JungHwan Park, Masaki Taniguchi
Gurtas Lefschetz Fibrations, Rational Blowdowns, and Exotic Symplectic Four-Manifolds
Anar Akhmedov, Sümeyra Sakallı