Related papers: On Crossing Ball Structure in Knot and Link Comple…
We provide various formulations of knot homology that are predicted by string dualities. In addition, we also explain the rich algebraic structure of knot homology which can be understood in terms of geometric representation theory in these…
We investigate border ranks of twisted powers of polynomials and smoothability of symmetric powers of algebras. We prove that the latter are smoothable. For the former, we obtain upper bounds for the border rank in general and prove that…
We show that if a classical knot diagram satisfies a certain combinatorial condition then it is minimal with respect to the number of classical crossings. This statement is proved by using the Kauffman bracket and the construction of atoms…
We give a description of all (1,2)-knots in S^3 which admit a closed meridionally incompressible surface of genus 2 in their complement. That is, we give several constructions of (1,2)-knots having a meridionally incompressible surface of…
We prove that any diagram of the unknot with c crossings may be reduced to the trivial diagram using at most (236 c)^{11} Reidemeister moves. Moreover, every diagram in this sequence has at most (7 c)^2 crossings. We also prove a similar…
Alternative proof is given for an earlier presented result that if a link in 3-space bounds a compact oriented proper surface (without closed component) in the upper half 4-space, then the link bounds a ribbon surface in the upper half…
In earlier work we introduced the graph bracket polynomial of graphs with marked vertices, motivated by the fact that the Kauffman bracket of a link diagram D is determined by a looped, marked version of the interlacement graph associated…
Let $D$ be a knot diagram, and let ${\mathcal D}$ denote the set of diagrams that can be obtained from $D$ by crossing exchanges. If $D$ has $n$ crossings, then ${\mathcal D}$ consists of $2^n$ diagrams. A folklore argument shows that at…
We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…
Given any possibly unbounded, locally finite link, we show that there exists a smooth diffeomorphism transforming this link into a set of stream (or vortex) lines of a vector field that solves the steady incompressible Euler equation in…
Cut-diagrams are diagrammatic objects, defined in dimensions 1 and 2, that generalize links in 3-space and surface-links in 4-space; in dimension 1, this coincides with the theory of welded links. Using cut-diagrams, we introduce an…
The existence of basket, flat plumbing and flat plumbing basket surfaces of a link was first proven from a braid representative of the link. In the present article, we show the existence of such surfaces from an induced graph of the link.…
In this article we conjecture a 4-dimensional characterization of tightness: a contact structure is tight if and only if a slice-Bennequin inequality holds for smoothly embedded surfaces in Yx[0,1]. An affirmative answer to our conjecture…
State surfaces are spanning surfaces of links that are obtained from link diagrams guided by the combinatorics underlying Kauffman's construction of the Jones polynomial via state models. Geometric properties of such surfaces are often…
A joint of a set of lines $\mathcal{L}$ in $\mathbb{F}^d$ is a point that is contained in $d$ lines with linearly independent directions. The joints problem asks for the maximum number of joints that are formed by $L$ lines. Guth and Katz…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
The Gauss self-linking integral of an unframed knot is not a knot invariant, but it can be turned into an invariant by adding a correction term which requires adding extra structure to the knot. We collect the different…
We model proteins with intramolecular bonds, such as disulfide bridges, using the concept of bonded knots -- closed loops in three-dimensional space equipped with additional bonds that connect different segments of the knot. We extend the…
The presence of slipknots in configurations of proteins and DNA has been shown to affect their functionality, or alter it entirely. Historically, polymers are modeled as polygonal chains in space. As an alternative to space curves, we…
Explanation methods aim to make neural networks more trustworthy and interpretable. In this paper, we demonstrate a property of explanation methods which is disconcerting for both of these purposes. Namely, we show that explanations can be…