Related papers: Brunnian links are determined by their complements

We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…

We show that for every m in N, there exists an n in N such that every embedding of the complete graph K_n in R^3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r in N such that every…

We suggest a new random model for links based on meander diagrams and graphs. We then prove that trivial links appear with vanishing probability in this model, no link $L$ is obtained with probability 1, and there is a lower bound for the…

We extend the equality-type results of Ito--Takimura and Kindred for the non-orientable genera of alternating knots to the setting of two-component alternating links. We show that, for such links, a unified quantity capturing both…

Taking the l^1-completion and the topological dual of the singular chain complex gives rise to l^1-homology and bounded cohomology respectively. In contrast to l^1-homology, major structural properties of bounded cohomology are well…

In the paper we investigate an algorithmic associative binary operation $*$ on the set $\mathcal{LR}_1$ of Littlewood-Richardson tableaux with entries equal to one. We extend $*$ to an algorithmic nonassociative binary operation on the set…

Let K and L be disjoint closed oriented submanifolds of the n-sphere, with dimensions adding up to n-1. We define a map from their join K*L to the n-sphere whose degree up to sign equals their linking number, and then use this to find the…

We study the space of "link maps": the space of maps of a disjoint union of compact, closed manifolds P_1, . . ., P_k into a manifold N whose images are pairwise disjoint. We apply the manifold calculus of functors developed by Goodwillie…

The topological information of a network can be retrieved equivalently from its complement consisting of the same nodes but complementary edges. Hence the partition of a network into certain substructures based on given criteria should be…

In this paper, we study a geometric/topological measure of knots and links called the nullification number. The nullification of knots/links is believed to be biologically relevant. For example, in DNA topology, one can intuitively regard…

We obtain a series of new results on the problem of irreducibility of commuting varieties associated with symmetric pairs or, in other words, $Z_2$-graded simple Lie algebras. In particular, we present many examples of reducible commuting…

Analogical reasoning depends fundamentally on the ability to learn and generalize about relations between objects. We develop an approach to relational learning which, given a set of pairs of objects…

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 prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number…

Polynomial algorithms are given for the following two problems: given a graph with $n$ vertices and $m$ edges, where $m \ge 3 n^{3/2}$, find a complete balanced bipartite subgraph with parts about $\ln n/(\ln (n^2/m))$, given a graph with…

In this paper, we define a lassoing on a link, a local addition of a trivial knot to a link. Let K be an s-component link with the Conway polynomial non-zero. Let L be a link which is obtained from K by r-iterated lassoings. The complete…

We generalize an algorithm of Rudolph to establish that every link is topologically concordant to a strongly quasipositive link.

We give a new, elementary proof of what we believe is the simplest known example of a ``natural'' problem in computational 3-dimensional topology that is $\mathsf{NP}$-hard -- namely, the \emph{Trivial Sublink Problem}: given a diagram $L$…

We generalise theorems of Cochran-Lickorish and Owens-Strle to the case of links with more than one component. This enables the use of linking forms on double branched covers, Heegaard Floer correction terms, and Donaldson's diagonalisation…

For every $n \ge 3$, we construct 2-component links in $S^{n+1}$ that are a split by an integer homology $n$-sphere, but not by $S^n$. In the special case $n=3$, i.e. that of 2-links in $S^4$, we produce an infinite family of links $L_\ell$…