Related papers: On the Classification of Rational Knots
New invariants for 2-dimensional cell complexes are defined, which can be interpreted as curvature bounds. These invariants are proved to be rational and computable in a companion article. This document is a survey that collects theorems…
We prove that the detection rate of n-crossing alternating links by many standard link invariants decays exponentially in n, implying that they detect alternating links with probability zero. This phenomenon applies broadly, in particular…
We introduce the warping matrix which is a new description of oriented knots from a viewpoint of warping degree.
Our main theorem classifies the Auslander-Reiten triangles according to properties of the morphisms involved. As a consequence, we are able to compute the mapping cone of an irreducible morphism. We finish by showing a technique for…
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
Prime power fold cyclic branched covers along smoothly slice knots all bound rational homology balls. This phenomenon, however, does not characterize slice knots. In this paper, we give a new construction of non-slice knots that have the…
We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group $S_{2n+1}$. We define two classes of moves on such permutations, called trivial petal additions and crossing…
An oriented compact 4-manifold $V$ with boundary $S^3$ is called a positon (resp. negaton) if its intersection form is positive definite (resp. negative definite) and it is simply connected. In this paper, we prove that there exist…
We construct a combinatorial invariant of Legendrian knots in standard contact three-space. This invariant, which encodes rational relative Symplectic Field Theory and extends contact homology, counts holomorphic disks with an arbitrary…
Either fibered knots supporting the tight contact structure are unique in their smooth concordance class or there exists a fibered counterexample to the Slice-Ribbon Conjecture.
Given a class of objects, a pattern theorem is a powerful result describing their structure. We show that alternating knots exhibit a pattern theorem, and use this result to prove a long-standing conjecture that alternating knots grow rare.…
We establish a conjecture of Mumford characterizing rationally connected complex projective manifolds in several cases.
The knot Floer complex and the concordance invariant $\varepsilon$ can be used to define a filtration on the smooth concordance group. We exhibit an ordered subset of this filtration that is isomorphic to $\mathbb{N} \times \mathbb{N}$ and…
We present two practical and widely applicable methods, including some criteria and a general procedure, for detecting Brunnian property of a link, if each component is known to be unknot. The methods are based on observation and handwork.…
We define a nontrivial mod 2 valued additive concordance invariant defined on the torsion subgroup of the knot concordance group using involutive knot Floer package. For knots not contained in its kernel, we prove that their iterated…
The art of tying knots is exploited in nature and occurs in multiple applications ranging from being an essential part of scouting programs to engineering molecular knots. Biomolecular knots, such as knotted proteins, bear various cellular…
Ropelength and embedding thickness are related measures of geometric complexity of classical knots and links in Euclidean space. In their recent work, Freedman and Krushkal posed a question regarding lower bounds for embedding thickness of…
This paper discusses some geometric ideas associated with knots in real projective 3-space $\mathbb{R}P^3$. These ideas are borrowed from classical knot theory. Since knots in $\mathbb{R}P^3$ are classified into three disjoint classes, -…
We study directed random graphs (random graphs whose edges are directed), and present new results on the so-called strong components of those graphs. We provide analytic and simulation results on two special classes of strong component,…
We study the enumeration of alternating links and tangles, considered up to topological (flype) equivalences. A weight $n$ is given to each connected component, and in particular the limit $n\to 0$ yields information about (alternating)…