Related papers: A remark on the counterexample to the unknotting n…

In Theorem 1.2 of the paper math.GT/0002110 the author claimed to have proved that all transversal knots whose topological knot type is that of an iterated torus knot (we call them cable knots) are transversally simple. That theorem is…

Let $T$ be a satellite knot, link, or spatial graph in a 3-manifold $M$ that is either $S^3$ or a lens space. Let $\mathfrak{b}_0$ and $\mathfrak{b}_1$ denote genus 0 and genus 1 bridge number, respectively. Suppose that $T$ has a companion…

We improve the upper bound on the superbridge index $sb[K]$ of a knot type $[K]$ in terms of the bridge index $b[K]$ from $sb[K] \leq 5b -3$ to $sb[K]\leq 3b[k] - 1$.

We provide evidences for the duality between ${\cal N}=6$ $U(M)_{4} \times U(N)_{-4}$ Chern-Simons matter theory and ${\cal N}=5$ $O(\hat{M})_{2} \times USp(2\hat{N})_{-1}$ theory for a suitable $\hat{M},\hat{N}$ by working out the…

It is known that there are only finitely many knots with super bridge index 3. Jin and Jeon have provided a list of possible such candidates. However, they conjectured that the only knots with super bridge index 3 are trefoil and the figure…

A quadrisecant of a knot is a straight line intersecting the knot at four points. If a knot has finitely many quadrisecants, one can replace each subarc between two adjacent secant points by the line segment between them to get the…

In 1965 Erd\H os conjectured that for all $k\ge2$, $s\ge1$ and $n\ge k(s+1)$, an $n$-vertex $k$-uniform hypergraph $\F$ with $\nu(\F)=s$ cannot have more than \newline $\max\{\binom{sk+k-1}k,\;\binom nk-\binom{n-s}k\}$ edges. It took almost…

Motivated by work of Kinoshita and Teraska, Lamm introduced the notion of a symmetric union, which can be constructed from a partial knot $J$ by introducing additional crossings to a diagram of $J \# -\!J$ along its axis of symmetry. If…

We calculate the alternating number of torus knots with braid index 4 and less. For the lower bound, we use the upsilon-invariant recently introduced by Ozsv\'ath, Stipsicz, and Szab\'o. For the upper bound, we use a known bound for braid…

Let $k$ and $\ell$ be positive integers. We prove that if $1 \leq \ell \leq o_k(k^{6/5})$, then in every large enough graph $G$, the fraction of $k$-vertex subsets that induce exactly $\ell$ edges is at most $1/e + o_k(1)$. Together with a…

There is no 5,7-triangulation of the torus, that is, no triangulation with exactly two exceptional vertices, of degree 5 and 7. Similarly, there is no 3,5-quadrangulation. The vertices of a 2,4-hexangulation of the torus cannot be…

We study Legendrian knots in a cabled knot type. Specifically, given a topological knot type K, we analyze the Legendrian knots in knot types obtained from K by cabling, in terms of Legendrian knots in the knot type K. As a corollary of…

Recently Iltgen, Lewark and Marino introduced the concept of a proper rational tangle replacement and the corresponding notion of the proper rational unknotting number. In this note we derive a version of the Montesinos trick for proper…

We show that there exist knots K in S^3 with g(E(K))=2 and g(E(K#K#K))=6. Together with Theorem~1.5 of [1], this proves existence of counterexamples to Morimoto's Conjecture (Conjecture 1.5 of [2]). This is a special case of…

We give examples of knots with some unusual properties of the crossing number of positive diagrams or strand number of positive braid representations. In particular we show that positive braid knots may not have positive minimal (strand…

The unknotting number of knots is a difficult quantity to compute, and even its behavior under basic satelliting operations is not understood. We establish a lower bound on the unknotting number of cable knots and iterated cable knots…

We extend recent work by Howie, Mathews and Purcell to simplify the calculation of A-polynomials for any family of hyperbolic knots related by twisting. The main result follows from the observation that equations defining the deformation…

A well-known algorithm for unknotting knots involves traversing a knot diagram and changing each crossing that is first encountered from below. The minimal number of crossings changed in this way across all diagrams for a knot is called the…

For any non-simple (1,1)-knot in $S^3$ or a lens space, we construct a co-oriented taut foliation in its complement that intersects the boundary torus transversely in a suspension foliation of the knot meridian, or the infinity slope. This…

An elementary introduction to Khovanov construction of superpolynomials. Despite its technical complexity, this method remains the only source of a definition of superpolynomials from the first principles and therefore is important for…