Related papers: Width is not additive

A Seifert surface F for a knot K is free if the complement of F is a handlebody (i.e., has free fundamental group). The free genus of K is the minimum genus among all free Seifert surfaces for K. In this paper we show that there exist…

In this paper, we prove that $w(K) =4w(J)$, where $w(.)$ is the width of a knot and $K$ is the Whitehead double of a nontrivial knot $J$.

For a knot K, the concordance crosscap number, c(K), is the minimum crosscap number among all knots concordant to K. Building on work of G. Zhang, which studied the determinants of knots with c(K) < 2, we apply the Alexander polynomial to…

By considering negative surgeries on a knot $K$ in $S^3$, we derive a lower bound to the non-orientable slice genus $\gamma_4(K)$ in terms of the signature $\sigma(K)$ and the concordance invariants $V_i(\overline{K})$, which strengthens a…

Let $r(k)$ denote the maximum number of edges in a $k$-uniform intersecting family with covering number $k$. Erd\H{o}s and Lov\'asz proved that $ \lfloor k! (e-1) \rfloor \leq r(k) \leq k^k.$ Frankl, Ota, and Tokushige improved the lower…

Knotted ribbons form an important topic in knot theory. They have applications in natural sciences, such as cyclic duplex DNA modeling. A flat knotted ribbon can be obtained by gently pulling a knotted ribbon tight so that it becomes flat…

New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used…

We report on the geometry and mechanics of knotted stiff strings. We discuss both closed and open knots. Our two main results are: (i) Their equilibrium energy as well as the equilibrium tension for open knots depend on the type of knot as…

We show the existence of infinitely many prime knots each of which having in their complements meridional essential surfaces with two boundary components and arbitrarily high genus.

A set N is called a "weak epsilon-net" (with respect to convex sets) for a finite set X in R^d if N intersects every convex set that contains at least epsilon*|X| points of X. For every fixed d>=2 and every r>=1 we construct sets X in R^d…

Suppose that there exists an epimorphism from the knot group of a $2$-bridge knot $K$ onto that of another knot $K'$. In this paper, we study the relationship between their crossing numbers $c(K)$ and $c(K')$. Especially it is shown that…

Two knots in three-space are S-equivalent if they are indistinguishable by Seifert matrices. We show that S-equivalence is generated by the doubled-delta move on knot diagrams. It follows as a corollary that a knot has trivial Alexander…

We develop a reinforcement learning pipeline for simplifying knot diagrams. A trained agent learns move proposals and a value heuristic for navigating Reidemeister moves. The pipeline applies to arbitrary knots and links; we test it on…

Let C_T be the subgroup of the smooth knot concordance group generated by topologically slice knots and let C_D be the subgroup generated by knots with trivial Alexander polynomial. We prove the quotient C_T/C_D is infinitely generated, and…

Distinct knots K, K' can sometimes share a common p/q-framed Dehn surgery. A folk conjecture held that for a fixed pair of knots, this can occur for at most one value of p/q. We disprove this conjecture by constructing pairs of distinct…

Let $G$ be a 3-partite graph with $k$ vertices in each part and suppose that between any two parts, there is no cycle of length four. Fischer and Matou\u{s}ek asked for the maximum number of triangles in such a graph. A simple construction…

Connected sum and trivalent vertex sum are natural operations on genus 2 spatial graphs and, as with knots, tunnel number behaves in interesting ways under these operations. We prove sharp Scharlemann-Schultens type bounds for the tunnel…

Let $K\subset S^3$ be a knot, $X:= S^3\setminus K$ its complement, and $\mathbb{T}$ the circle group identified with $\mathbb{R}/\mathbb{Z}$. To any oriented long knot diagram of $K$, we associate a quadratic polynomial in variables…

First-Fit is a greedy algorithm for partitioning the elements of a poset into chains. Let $\textrm{FF}(w,Q)$ be the maximum number of chains that First-Fit uses on a $Q$-free poset of width $w$. A result due to Bosek, Krawczyk, and Matecki…

M. Scharlemann has recently proved that any genus one tunnel number one knot is either a satellite or 2-bridge knot, as conjectured by H. Goda and M. Teragaito; all such knots admit a (1,1) decomposition. In this paper we give a…