Related papers: A lower bound for the doubly slice genus from sign…

We investigate the nonorientable 4-genus $\gamma_4$ of a special family of 2-bridge knots, the twist knots and double twist knots $C(m,n)$. Because the nonorientable 4-genus is bounded by the nonorientable 3-genus, it is known that…

Let K be a knot in the 3-sphere. A slope p/q is said to be characterising for K if whenever p/q surgery on K is homeomorphic, via an orientation-preserving homeomorphism, to p/q surgery on another knot K' in the 3-sphere, then K and K' are…

Turaev defined a function on the first homology of a rational homology 3-sphere $Y$ as the minimal rational Seifert genus of all knots in this homology class. Ni and the first author discovered a lower bound of this function using the…

Cochran, Orr, and Teichner developed a filtration of the knot concordance group indexed by half integers called the solvable filtration. Its terms are denoted by $\mathcal{F}_n$. It has been shown that $\mathcal{F}_n/\mathcal{F}_{n.5}$ is a…

We introduce a new technique to certify lower bounds on the multicut size using network coding. In directed networks the network coding rate is not a lower bound on the multicut, but we identify a class of networks on which the rate is…

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…

We find the minimum dilatation of pseudo-Anosov homeomorphisms that stabilize an orientable foliation on surfaces of genus three, four, or five, and provide a lower bound for genus six to eight. Our technique also simplifies Cho and Ham's…

The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…

We classify knot traces with trisection genus at most 2. We give infinitely many knots whose traces have trisection genus 3, and infinitely many knots whose traces have trisection genus 4. We also show that there exist infinite families of…

Kronheimer and Mrowka asked whether the difference between the four-dimensional clasp number and the slice genus can be arbitrarily large. This question is answered affirmatively by studying a knot invariant derived from equivariant…

We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc…

We introduce a new technique for showing classical knots and links are not slice. As one application we resolve a long-standing question as to whether certain natural families of knots contain topologically slice knots. We also present a…

A knot is said to be slice if it bounds a smooth properly embedded disk in the 4-ball. We demonstrate that the Conway knot, 11n34 in the Rolfsen tables, is not slice. This completes the classification of slice knots under 13 crossings, and…

We generalize the Guth--Katz joints theorem from lines to varieties. A special case says that $N$ planes (2-flats) in 6 dimensions (over any field) have $O(N^{3/2})$ joints, where a joint is a point contained in a triple of these planes not…

We show that the difference between the Seifert genus and the topological 4-genus of a prime positive braid knot is bounded from below by an affine function of the minimal number of strands among positive braid representatives of the knot.…

We give a new proof that the Levine-Tristram signatures of a link give lower bounds for the minimal sum of the genera of a collection of oriented, locally flat, disjointly embedded surfaces that the link can bound in the 4-ball. We call…

For a nontrivial knot $K$, Negami found an upper bound on the stick number $s(K)$ in terms of its crossing number $c(K)$ which is $s(K) \leq 2 c(K)$. Later, Huh and Oh utilized the arc index $\alpha(K)$ to present a more precise upper bound…

This paper investigates the relationship between the signature and the crossing number of knots and links. We refine existing theorems and provide a comprehensive classification of links with specific properties, particularly those with…

An identifying open code of a graph $G$ is a set $S$ of vertices that is both a separating open code (that is, $N_G(u) \cap S \ne N_G(v) \cap S$ for all distinct vertices $u$ and $v$ in $G$) and a total dominating set (that is, $N(v) \cap S…

We construct examples of non-isotrivial algebraic families of smooth complex projective curves over a curve of genus 2. This solves a problem from Kirby's list of problems in low-dimensional topology. Namely, we show that 2 is the smallest…