Related papers: Constructing and Cataloging 2-Adjacent Knots

We introduce an unknotting-type number of knot projections that gives an upper bound of the crosscap number of knots. We determine the set of knot projections with the unknotting-type number at most two, and this result implies classical…

This paper concerns the H(2)-unknotting numbers of links related to 2-bridge links. It consists of three parts. In the first part, we consider a necessary and sufficient condition for a 2-bridge link to have H(2)-unknotting number one. The…

Given a band sum of a split two-component link along a nontrivial band, we obtain a family of knots indexed by the integers by adding any number of full twists to the band. We show that the knots in this family have the same Heegaard knot…

The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J.…

We prove that if an alternating knot has unknotting number one, then there exists an unknotting crossing in any alternating diagram. This is done by showing that the obstruction to unknotting number one developed by Greene in his work on…

We exhibit pairs of transverse knots with the same self-linking number that are not transversely isotopic, using the recently defined knot Floer homology invariant for transverse knots and some algebraic refinements of it.

We use the Heegaard Floer obstructions defined by Grigsby, Ruberman, and Strle to show that forty-six of the sixty-seven knots through eleven crossings whose concordance orders were previously unknown have infinite concordance order.

We use the knot filtration on the Heegaard Floer complex to define an integer invariant tau(K) for knots. Like the classical signature, this invariant gives a homomorphism from the knot concordance group to Z. As such, it gives lower bounds…

We have developed a reinforcement learning agent that often finds a minimal sequence of unknotting crossing changes for a knot diagram with up to 200 crossings, hence giving an upper bound on the unknotting number. We have used this to…

Given a knot K we introduce a new invariant coming from the Blanchfield pairing and we show that it gives a lower bound on the unknotting number of K. This lower bound subsumes the lower bounds given by the Levine-Tristram signatures, by…

We define three different types of spanning surfaces for knots in thickened surfaces. We use these to introduce new Seifert matrices, Alexander-type polynomials, genera, and a signature invariant. One of these Alexander polynomials extends…

Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…

We use matchings on Lyndon words to classify flat knots up to 8 crossings. Using flat knots invariants such as the based matrix, the $\phi$-invariant, the flat arrow polynomial, and the flat Jones-Krushkal polynomial, we distinguish all…

This thesis develops some general calculational techniques for finding the orders of knots in the topological concordance group C. The techniques currently available in the literature are either too theoretical, applying to only a small…

We establish inequalities that constrain the genera of smooth cobordisms between knots in 4-dimensional cobordisms. These "relative adjunction inequalities" improve the adjunction inequalities for closed surfaces which have been…

We proved by computer enumeration that the Jones polynomial distinguishes the unknot for knots up to 22 crossings. Following an approach of Yamada, we generated knot diagrams by inserting algebraic tangles into Conway polyhedra, computed…

We introduced concept of meander knots, 2-component meander links and multi-component meander links and derived different families of meander knots and links from open meanders with at most 16 crossings. We also defined semi-meander knots…

Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certain infinite sequence of diagrams of the trivial…

For any given number of crossings $c$, there exists a formula to determine the number of 2-bridge knots of $c$ crossings, and indeed it is a simple matter to actually construct presentations of these knots. However, the determination of…

A knot K is called n-adjacent to another knot K', if K admits a projection containing n generalized crossings such that changing any 0 < m \leq n of them yields a projection of K'. We apply techniques from the theory of sutured 3-manifolds,…