Related papers: An algorithm to find ribbon disks for alternating …
It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…
We investigate the question of the existence of a Lagrangian concordance between two Legendrian knots in $\mathbb{R}^3$. In particular, we give obstructions to a concordance from an arbitrary knot to the standard Legendrian unknot, in terms…
This paper introduces a new algebra, the crossing algebra, that is applied to count the number of components for arborescent knots, links, tangles or states (of a state polynomial expansion such as the Kauffman bracket). This algebra is…
Using computer calculations and working with representatives of pretzel tangles we established general adequacy criteria for different classes of knots and links. Based on adequate graphs obtained from all Kauffman states of an alternating…
Kakimizu complexes have been found for several classes of links. O.Kakimizu found the Kakimizu complexes of knots with crossing number less than or equal to 10. Hatcher and Thurston found the 0-skeleton of the Kakimizu complex of 2-bridge…
We study the enumeration of alternating links and tangles, considered up to topological (flype) equivalences. A weight $n$ is given to each connected component, and in particular the limit $n\to 0$ yields information about (alternating)…
This paper is devoted to prove the existence of $q$-periodic alternating projections of prime alternating $q$-periodic knots. The main tool is the Menasco-Thistlethwaite's Flyping theorem. Let $K$ be an oriented prime alternating knot that…
The purpose of the paper is two-fold: to introduce a multivariable creative telescoping method, and to apply it in a problem of Quantum Topology: namely the computation of the non-commutative $A$-polynomial of twist knots. Our multivariable…
A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like the Internet. Thus, having the routing paths globally…
We show that a two-bridge ribbon knot $K(m^2 , m k \pm 1)$ with $m > k >0$ and $(m,k)=1$ admits a symmetric union presentation with partial knot which is a two-bridge knot $K(m,k)$. Similar descriptions for all the other two-bridge ribbon…
A knot is a circle piecewise-linearly embedded into the 3-sphere. The topology of a knot is intimately related to that of its exterior, which is the complement of an open regular neighborhood of the knot. Knots are typically encoded by…
This thesis is concerned with the question of when the double branched cover of an alternating knot can arise by Dehn surgery on a knot in $S^3$. We approach this problem using a surgery obstruction, first developed by Greene, which…
We present new computations of tight shapes obtained using the constrained gradient descent code RIDGERUNNER for 544 composite knots with 12 and fewer crossings, expanding our dataset to 943 knots and links. We use the new data set to…
This paper gives new and elementary combinatorial topological proofs of the classification of unoriented and oriented rational knots and links. These proofs are based on the known classification of alternating knots through flyping, and the…
Surgery on a knot in $S^3$ is said to be an alternating surgery if it yields the double branched cover of an alternating link. The main theoretical contribution is to show that the set of alternating surgery slopes is algorithmically…
We provide an algorithm to determine whether a link L admits a crossing change that turns it into a split link, under some fairly mild hypotheses on L. The algorithm also provides a complete list of all such crossing changes. It can…
We exhibit an algorithm to determine the bridge number of a hyperbolic knot in the 3-sphere. The proof uses adaptations of almost normal surface theory for compact surfaces with boundary in ideally triangulated knot exteriors.
We describe a Python module that we developed to calculate cobordism maps induced on Khovanov homology. As applications of our program, we compute these maps for all incompressible Seifert surfaces for prime knots up to 10 crossings, and…
Extending upon our previous work, we verify the Jones Unknot Conjecture for all knots up to $24$ crossings. We describe the method of our approach and analyze the growth of the computational complexity of its different components.
We define cylinder knots as billiard knots in a cylinder. We present a necessary condition for cylinder knots: after dividing cylinder knots by possible rotational symmetries we obtain ribbon knots. We obtain an upper bound for the number…