Related papers: On the warping sum of knots

An embedded graph is called $z$-knotted if it contains the unique zigzag (up to reversing). We consider $z$-knotted triangulations, i.e. $z$-knotted embedded graphs whose faces are triangles, and describe all cases when the connected sum of…

Relative self-linking and linking "numbers" for pairs of knots in oriented 3-manifolds are defined in terms of intersection invariants of immersed surfaces in 4-manifolds. The resulting concordance invariants generalize the usual…

The crossing number $cr(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$-planar crossing number of $G$, $cr_k(G)$, is defined as the minimum of…

The ropelength of a knot is the minimum contour length of a tube of unit radius that traces out the knot in three dimensional space without self-overlap, colloquially the minimum amount of rope needed to tie a given knot. Theoretical upper…

The values of writhe of the most tight conformations, found by the SONO algorithm, of all alternating prime knots with up to 10 crossings are analysed. The distribution of the writhe values is shown to be concentrated around the equally…

The cobordism distance between knots, d(K,J), equals the four-genus g_4(K # -J). We consider d(K,K^r), where K^r is the reverse of K. It is elementary that 0 \le d(K,K^r) \le 2g_4(K) and it is known that there are knots K for which d(K,K^r)…

The subgraph number of a vertex in a graph is defined as the number of connected subgraphs containing that vertex. The graph and its vertex which correspond to the minimum subgraph number among all graphs on $n$ vertices and $k$ cut…

This paper proposes the definition of a quantum knot as a linear superposition of classical knots in three dimensional space. The definition is constructed and examples are discussed. Then the paper details extensions and also limitations…

We specify the computational complexity of crosscap numbers of alternating knots by introducing an automatic computation. For an alternating knot $K$, let $\cal{E}$ be the number of edges of its diagram. Then there exists a code such that…

The non-orientable 4-genus of a knot $K$ in $S^{3}$, denoted $\gamma_4(K)$, measures the minimum genus of a non-orientable surface in $B^{4}$ bounded by $K$. We compute bounds for the non-orientable 4-genus of knots $T_{5, q}$ and $T_{6,…

For a positive integer $k$, a graph is $k$-knitted if for each $k$-subset $S$ of vertices, and every partition of $S$ into disjoint parts $S_1, \ldots, S_t$ for some $t\ge 1$, one can find disjoint connected subgraphs $C_1, \ldots, C_t$…

Given a knot K in S^3, let u^-(K) (respectively, u^+(K)) denote the minimum number of negative (respectively, positive) crossing changes among all unknotting sequences for K. We use knot Floer homology to construct the invariants l^-(K),…

A tree with at most k leaves is called k-ended tree, and a tree with exactly k leaves is called k-end tree, where a leaf is a vertex of degree one. Contraction of a graph G along the edge e means deleting the edge e and identifying its end…

In a lens space X of order r a knot K representing an element of the fundamental group pi_1 X = Z/rZ of order s <= r contains a connected orientable surface S properly embedded in its exterior X-N(K) such that the boundary of S intersects…

A slope $p/q$ is characterising for a knot $K \subset \mathbb{S}^3$ if the orientation-preserving homeomorphism type of the manifold $\mathbb{S}^3_K(p/q)$ obtained by performing Dehn surgery of slope $p/q$ along $K$ uniquely determines the…

We study the $\mathbb{CP}^2$-slicing number of knots, i.e. the smallest $m\geq 0$ such that a knot $K\subseteq S^3$ bounds a properly embedded, null-homologous disk in a punctured connected sum $(\#^m\mathbb{CP}^2)^{\times}$. We give a…

An upper bound of the superbridge index of the connected sum of two knots is given in terms of the braid index of the summands. Using this upper bound and minimal polygonal presentations, we give an upper bound in terms of the superbridge…

We investigate the minimal number of links and knots in complete partite graphs. We provide exact values or bounds on the minimal number of links for all complete partite graphs with all but 4 vertices in one partition, or with 9 vertices…

We show that the torsion order $\mathrm{Ord}(K)$ of a knot $K$ in knot Floer homology gives a lower bound on the minimum number $n$ such that an oriented $(n+1)$-tangle replacement unknots $K$. This generalizes earlier results by Alishahi…

We give the first examples of a pair of knots $K_1$,$K_2$ in the 3-sphere for which their unknotting numbers satisfy $u(K_1\#K_2)<u(K_1)+u(K_2)$ . This answers question 1.69(B) from Kirby's problem list, "Problems in low-dimensional…