Related papers: Knots not detected by any trace
We derive a linear estimate of the signature of positive knots, in terms of their genus. As an application, we show that every knot concordance class contains at most finitely many positive knots.
We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…
A classical knot is described by a one-stroke trajectory with entanglements of a string. The replica method appears as a powerful tool in statistical mechanics for a polymer or self-avoiding walk. We consider this replica N to 0 limit in…
We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that…
A polynomial is presented that models a topological knot in a unique manner. It distinguishes all types of knots including the orientation and has a group theory interpretation. The topologies may be labeled via a number, which upon a base…
We introduce new sufficient conditions for intrinsic knotting and linking. A graph on n vertices with at least 4n-9 edges is intrinsically linked. A graph on n vertices with at least 5n-14 edges is intrinsically knotted. We also classify…
It has been an open question whether the deletion or contraction of an edge in an intrinsically knotted graph always yields an intrinsically linked graph. We present a new intrinsically knotted graph that shows the answer to both questions…
We say that a graph is intrinsically knotted or completely 3-linked if every embedding of the graph into the 3-sphere contains a nontrivial knot or a 3-component link any of whose 2-component sublink is nonsplittable. We show that a graph…
We show that every nonzero integer occurs in the denominator of a boundary slope for infinitely many (1,1)-knots and that infinitely many (1,1)-knots have boundary slopes of arbitrarily small difference. Specifically, we prove that for any…
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 show that for each even integer $m\ge 2$, every reduced shadow with sufficiently many crossings is a shadow of a torus knot T(2,m+1), or of a twist knot $T_m$, or of a connected sum of $m$ trefoil knots.
We prove that there exist infinitely many topologically slice knots which cannot bound a smooth null-homologous disk in any definite 4-manifold. Furthermore, we show that we can take such knots so that they are linearly independent in the…
The main goal of this paper is to prove that for odd free knots - that is free knots with all odd crossings - the problem of sliceness (the existence of a spanning disc) has an explicit answer based on the pairing of the knot diagram…
We give a necessary condition for a torus knot to be untied by a single twisting. By using this result, we give infinitely many torus knots that cannot be untied by a single twisting.
We study the gordian graph of all knots in $\R^3$: two knots are adjacent if they differ by a single crossing change. We prove that this graph contains isometrically an infinite countable tree with infinite valency, and that the complement…
We present four models for a random graph and show that, in each case, the probability that a graph is intrinsically knotted goes to one as the number of vertices increases. We also argue that, for $k \geq 18$, most graphs of order $k$ are…
To each unit complex number with positive imaginary part there is defined a Tristram-Levine knot signature function. The set of all such signature functions is linearly independent as a set of functions defined on the set of all knots. The…
The $m$-trace of a knot is the $4$-manifold obtained from $\mathbf{B}^4$ by attaching a $2$-handle along the knot with $m$-framing. In 2015, Abe, Jong, Luecke and Osoinach introduced a technique to construct infinitely many knots with the…
We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically…
Steinhaus conjectured that every closed oriented $C^1$-curve has a pair of anti-parallel tangents. Porter disproved the conjecture by showing that there exist curves with no anti-parallel tangents. Colin Adams rised the question of whether…