Related papers: Brunnian links are determined by their complements
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 give a classification of $n$-component links up to $C_n$-move. In order to prove this classification, we characterize Brunnian links, and have that a Brunnian link is ambient isotopic to a band sum of trivial link and Milnor's links.
We present new techniques to show hyperbolicity of links based on geometric/combinatorial topology. Our techniques are applicable to links that have at least one unknotted component. In particular, they are applicable to Brunnian links. We…
We prove that if n\ge1, then an (n+1)-component Brunnian link L in a connected, oriented 3-manifold is C_n-equivalent to an unlink. We also prove that if n\ge2, then L can not be distinguished from an unlink by any Goussarov-Vassiliev…
If L is an oriented link with $n$ components, then the rank of its Khovanov homology is at least $2^n$. We classify all the links whose Khovanov homology with Z/2-coefficients achieves this lower bound, and show that such links can be…
A link L is called Brunnian if every proper sublink of L is trivial. Similarly, a bottom tangle T is called Brunnian if every proper subtangle of T is trivial. In this paper, we give a small subalgebra of the n-fold completed tensor power…
This paper gives the first examples of gordian unlinks. The components of these unlinks cannot be separated while maintaining constant length and thickness. We construct infinite families of 2-component gordian unlinks and also construct…
We provide an algorithm to determine whether a link L admits a crossing change that turns it into a split link, under some fairly mild hypotheses on L. The algorithm also provides a complete list of all such crossing changes. It can…
We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…
A link L in the 3-sphere is called Brunnian if every proper sublink of L is trivial. In a previous paper, the first author proved that the restriction to Brunnian links of any Goussarov-Vassiliev finite type invariant of (n+1)-component…
In this paper, we construct two families of satellite constructions for Brunnian links, called the satellite sum and the satellite tie. An interesting fact is that by applying the satellite sum and the satellite tie constructions, we can…
Given an $m$-component link $L$ in $S^3$ ($m \ge 2$), we construct a family of links which are link homotopic, but not link isotopic, to $L$. Every proper sublink of such a link is link isotopic to the corresponding sublink of $L$.…
We construct an algorithm to decide whether two given Legendrian or transverse links are equivalent. In general, the complexity of the algorithm is too high for practical implementation. However, in many cases, when the symmetry group of…
We prove the following results (1) (2) (3) on relations between $n$-links and their components. (1) Let L=(L_1, L_2) be a (4k+1)-link (4k+1\geq 5). Then we have Arf L=Arf L_1+Arf L_2. (2) Let L=(L_1, L_2) be a (4k+3)-link (4k+3\geq3). Then…
We consider the operation of Whitehead double on a component of a link and study the behavior of Milnor invariants under this operation. We show that this operation turns a link whose Milnor invariants of length < k are all zero into a link…
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…
In this paper, we show that two flat fully augmented links with homeomorphic complements must be equivalent as links in $\mathbb{S}^{3}$. This requires a careful analysis of how totally geodesic surfaces and cusps intersect in these link…
This paper proves that convex Brunnian links exist for every dimension $n \geq 3$ by constructing explicit examples. These examples are three-component links which are higher-dimensional generalizations of the Borromean rings.
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…
We consider surgery moves along (n+1)-component Brunnian links in compact connected oriented 3-manifolds, where the framing of the each component is 1/k for k in Z. We show that no finite type invariant of degree < 2n-2 can detect such a…