Related papers: Studying Links via Plats: The Unlink
We prove a prime decomposition theorem for string links in a thickened surface. Namely, we prove that any non-braid string link $\ell \subset \Sigma \times I$, where $\Sigma$ is a compact orientable (not necessarily closed) surface other…
Knots and links in 3-manifolds are studied by applying intersection invariants to singular concordances. The resulting link invariants generalize the Arf invariant, the mod 2 Sato-Levine invariants, and Milnor's triple linking numbers.…
In the well-known Minimum Linear Arrangement problem (MinLA), the goal is to arrange the nodes of an undirected graph into a permutation so that the total stretch of the edges is minimized. This paper studies an online (learning) variant of…
In this paper we introduce a representation of knots and links called a cube diagram. We show that a property of a cube diagram is a link invariant if and only if the property is invariant under two types of cube diagram operations. A knot…
Graph matching consists of aligning the vertices of two unlabeled graphs in order to maximize the shared structure across networks; when the graphs are unipartite, this is commonly formulated as minimizing their edge disagreements. In this…
Biracks are algebraic structures related to knots and links. We define a new enhancement of the birack counting invariant for oriented classical and virtual knots and links via algebraic structures called birack dynamical cocycles. The new…
We investigate the lattice index theorem and the localization of the zero-modes for thick classical center vortices. For non-orientable spherical vortices, the index of the overlap Dirac operator differs from the topological charge although…
In this note we make use of some properties of vector fields on a manifold to give an alternate proof to [3] for the equivalence between connections and parallel transport on vector bundles over manifolds. Out of the proof will emerge a new…
Recently N.A'Campo suggested a construction of a link from a generic immersion of a curve into a 2-disk. It is tightly related to the singularity theory. In this paper, we give a simple procedure to draw a diagram of the link from a picture…
A classical knot is described by a one-stroke trajectory with entanglements of a string. The replica method appears as a powerful tool in statistical mechanics for a polymer or self-avoiding walk. We consider this replica N to 0 limit in…
We consider arrow diagrams of links in $S^3$ and define $k$-moves on such diagrams, for any $k\in\mathbb N$. We study the equivalence classes of links in $S^3$ up to $k$-moves. For $k=2$, we show that any two knots are equivalent, whereas…
For a set $P$ of $n$ points in the plane in general position, a non-crossing spanning tree is a spanning tree of the points where every edge is a straight-line segment between a pair of points and no two edges intersect except at a common…
We develop a word mechanism applied in knot and link diagrams for the illustration of a diagrammatic property. We also give a necessary condition for determining incompressible and pairwise incompressible surfaces, that are embedded in knot…
In this paper we study further when tangles embed into the unknot, the unlink or a split link. In particular, we study obstructions to these properties through geometric characterizations, tangle sums and colorings. As an application we…
It is well-known that no knot can be cancelled in a connected sum with another knot, whereas every link can be cancelled up to link homotopy in a (componentwise) connected sum with another link. In this paper we address the question whether…
In the previous paper, we considered a link diagram invariant of Hass and Nowik type using regular smoothing and unknotting number, to estimate the number of Reidemeister moves needed for unlinking. In this paper, we introduce a new link…
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)…
Given a finite point set P in general position in the plane, a full triangulation is a maximal straight-line embedded plane graph on P. A partial triangulation is a full triangulation of some subset P' of P containing all extreme points in…
We relate some terms on the boundary of the Newton polygon of the Alexander polynomial $\Delta(x,y)$ of a rational link to the number and length of monochromatic twist sites in a particular diagram that we call the standard form. Normalize…
We introduce an invariant of alternating knots and links (called here WRP), namely a pair of integer polynomials associated with their two checkerboard planar graphs from their minimal diagram. We prove that the invariant is well-defined…