Related papers: Tangle decompositions of alternating link compleme…
We apply the twisting technique that was first introduced in \cite{CK} and later generalized in \cite{QCQ} to obtain an infinite family of adequate, homogeneous or alternative links from a given adequate, homogeneous or alternative link,…
We determine p-colorability of the paradromic rings. These rings arise by generalizing the well-known experiment of bisecting a Mobius strip. Instead of joining the ends with a single half twist, use $m$ twists, and, rather than bisecting…
Danos and Regnier introduced generalized (non-binary) multiplicative connectives in Danos and Regnier [2]. They showed that there exist generalized multiplicative connectives that cannot be defined by any combination of the tensor and par…
We show how an image can, in principle, be described by the tangles of the graph of its pixels. The tangle-tree theorem provides a nested set of separations that efficiently distinguish all the distinguishable tangles in a graph. This…
In 2000, Thomas Fink and Young Mao studied neck ties and, with certain assumptions, found 85 different ways to tie a neck tie. They gave a formal language which describes how a tie is made, giving a sequence of moves for each neck tie. The…
We extend Howie's characterization of alternating knots to give a topological characterization of toroidally alternating knots, which were defined by Adams. We provide necessary and sufficient conditions for a knot to be toroidally…
Pseudo links have two crossing types: classical crossings and indeterminate crossings. They were first introduced by Ryo Hanaki as a possible tool for analyzing images produced by electron microscopy of DNA. A normalized bracket polynomial…
Tied links and the tied braid monoid were introduced recently by the authors and used to define new invariants for classical links. Here, we give a version purely algebraic-combinatoric of tied links. With this new version we prove that the…
Given a graph or a matroid, a tree of tangles is a tree decomposition that displays the structure of the connectivity: every edge of the decomposition tree induces a separation, that is, a way to divide the graph or matroid into two parts;…
We extend the tangle model, originally developed by Ernst and Sumners, to include composite knots. We show that, for any prime tangle, there are no rational tangle attachments of distance greater than one that first yield a 4-plat and then…
This paper is an introduction to the subject of virtual knot theory, combined with a discussion of some specific new theorems about virtual knots. The new results are as follows: We prove, using a 3-dimensional topology approach that if a…
Tangle structure trees, introduced in [3], offer a unified data structure that displays all the tangles of a graph or data set together with certificates for the non-existence of any other tangles, either locally or overall. In this paper…
We construct an infinite family of quasi-alternating links from a given quasi-alternating link by replacing a crossing by a product of rational tangles each of which extends that crossing. Consequently, we determine an infinite family of…
We say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime…
We address primary decomposition conjectures for knot concordance groups, which predict direct sum decompositions into primary parts. We show that the smooth concordance group of topologically slice knots has a large subgroup for which the…
We introduce stable equivalence classes of oriented links in orientable three-manifolds that are orientation $I$-bundles over closed but not necessarily orientable surfaces. We call these twisted links, and show that they subsume the…
The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…
We explore the possibility of applying the framework of frequent pattern mining to a class of continuous objects appearing in nature, namely knots. We introduce the frequent knot mining problem and present a solution. The key observation is…
2-dimensional knots and links are studied in the article. The notion of parity is introduced via techniques similar to the ones used by the second named author in 1-dimensional case. By using parity new invariants are constructed and known…
Cohomology theory of links, introduced by the author, is combinatorial. Dror Bar-Natan recently wrote a program that found ranks of cohomology groups of all prime knots with up to 11 crossings. His surprising experimental data is discussed…