Related papers: Constructing knot tunnels using giant steps
Every classical or virtual knot is equivalent to the unknot via a sequence of extended Reidemeister moves and the so-called forbidden moves. The minimum number of forbidden moves necessary to unknot a given knot is an invariant we call the…
A knot is an an embedding of a circle into three-dimensional space. We say that a knot is unknotted if there is an ambient isotopy of the embedding to a standard circle. By representing knots via planar diagrams, we discuss the problem of…
Ng constructed an invariant of knots in ${\mathbb{R}}^3$, a combinatorial knot contact homology. Extending his study, we construct an invariant of surface-knots in ${\mathbb{R}}^4$ using diagrams in ${\mathbb{R}}^3$.
We show a combinatorial argument in the diagram of large class of links, including satellite and hyperbolic links, where for each of which the tunnel number is the minimum possible, the number of its components minus one.
We introduce the abstract notion of a chain, which is a sequence of $n$ points in the plane, ordered by $x$-coordinates, so that the edge between any two consecutive points is unavoidable as far as triangulations are concerned. A general…
The quantum mechanical tunneling through multiple quantum barriers is a long-standing and well-known problem. Three methods proposed earlier to calculate the tunneling probabilities and energy splitting: (1). Instanton Method (2) WKb…
A quadruple crossing is a crossing in a projection of a knot or link that has four strands of the knot passing straight through it. A quadruple crossing projection is a projection such that all of the crossings are quadruple crossings. In a…
The maximum length of the shortest path from a leaf to the root of a skein tree for knots and links gives a measure of the complexity of computing link polynomials by the skein relation (the Jones polynomial, the Alexander-Conway…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…
In this paper we show how to realize all knot (and link) types as C^{2} smooth curves of constant curvature. Our proof is constructive: we build the knots with copies of a fixed finite number of "building blocks" that are particular…
Over the preceeding twenty years, the role of underlying classical dynamics in quantum mechanical tunneling has received considerable attention. A number of new tunneling phenomena have been uncovered that have been directly linked to the…
We review recent developments in the theory of Thompson group representations related to knot theory.
The creation of tunable open quantum systems is becoming feasible in current experiments with ultracold atoms in low-dimensional traps. In particular, the high degree of experimental control over these systems allows detailed studies of…
A simple mechanical analog describing Landau-Zener tunneling effect is proposed using two weakly coupled chains of nonlinear oscillators with gradually decreasing (first chain) and increasing (second chain) masses. The model allows to…
We calculate the twisted Alexander polynomials of all tunnel number one Montesinos knots associated to their $SL_2(\mathbb{C})$-representations and obtain their leading coefficients and degrees. As a corollary, we get some interesting…
Let $K$ be a knot with an unknotting tunnel $\gamma$ and suppose that $K$ is not a 2-bridge knot. There is an invariant $\rho = p/q \in \mathbb{Q}/2 \mathbb{Z}$, $p$ odd, defined for the pair $(K, \gamma)$. The invariant $\rho$ has…
We use the Chebyshev knot diagram model of Koseleff and Pecker in order to introduce a random knot diagram model by assigning the crossings to be positive or negative uniformly at random. We give a formula for the probability of choosing a…
The distortion of a curve is the supremum, taken over distinct pairs of points of the curve, of the ratio of arclength to spatial distance between the points. Gromov asked in 1981 whether a curve in every knot type can be constructed with…
Inspired by artistic practices such as beadwork and himmeli, we study the problem of threading a single string through a set of tubes, so that pulling the string forms a desired graph. More precisely, given a connected graph (where edges…
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…