Related papers: New Constructions of Slice Links
In this paper, we give a simple proof for the small cancellation conditions of the upper presentations of 2-bridge link groups, which holds the key to the proof of the main result of [1]. We also give an alternative proof of the main result…
We prove gluing theorems for tight contact structures. In particular, we rederive (as special cases) gluing theorems due to Colin and Makar-Limanov, and present an algorithm for determining whether a given contact structure on a handlebody…
We prove that any arc-presentation of the unknot admits a monotonic simplification by elementary moves; this yields a simple algorithm for recognizing the unknot. We obtain similar results for split links and composite links.
We prove a Slice Theorem around closed leaves in a singular Riemannian foliation, and we use it to study the $C^\infty$-algebra of smooth basic functions, generalizing to the inhomogeneous setting a number of results by G.~Schwarz. In…
We introduce a technique called graph fission which takes in a graph which potentially contains only one observation per node (whose distribution lies in a known class) and produces two (or more) independent graphs with the same node/edge…
We extend some classical results of Bankwitz, Crowell, and Murasugi to the setting of virtual links. For instance, we show that an alternating virtual link is split if and only if it is visibly split, and that the Alexander polynomial of…
In this paper, a link diagram is said to be minimal if no Reidemeister move I or II can be applied to it to reduce the number of crossings. We show that for an arbitrary diagram D of a link without a trivial split component, a minimal…
We define and undertake a systematic study of thick, syndetic, and piecewise syndetic subsets of a Fra\"iss\'e structure. Each of these collections forms a family in the sense of Akin and Glasner [AG], and we define and study ultrafilters…
We propose a novel and efficient method for link prediction in bipartite networks, using \textit{formal concept analysis} (FCA) and the Transformer encoder. Link prediction in bipartite networks finds practical applications in various…
The goal of this paper is to develop a theory of join and slices for strict $\infty$-categories. To any pair of strict $\infty$-categories, we associate a third one that we call their join. This operation is compatible with the usual join…
A Divide with cusps is the image of a proper generic immersion from finite intervals and circles into a $2$-disk which allows to have cusps. A divide with cusps is the generalization of the notion of the divide which is introduced by…
In this paper, we establish a connection between Dunkl analysis and slice analysis in the setting of Clifford algebras. Specifically, we show that a Clifford algebra-valued function is slice if, and only if, it belongs to the kernel of the…
We introduce a new very large family of transformations of rectangular diagrams of links that preserve the isotopy class of the link. We provide an example when two diagrams of the same complexity are related by such a transformation and…
We show how the theory of tangles is equivalent to that of well-connected tangles. These are drawn on a surface with boundary, and equivalent via Reidemeister moves of a restricted kind. This reworking of the graphical foundations for link…
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…
Using the band representation of the 3-strand braid group, it is shown that the genus of 3-braid links can be read off their skein polynomial. Some applications are given, in particular a simple proof of Morton's conjectured inequality and…
We piece together ingredients, which are well known and documented in the literature, into a new proof of the existence of semistable 3-fold flips
As a corollary of work of Ozsvath and Szabo [math.GT/0301149], it is shown that the classical concordance group of algebraically slice knots has an infinite cyclic summand and in particular is not a divisible group.
In social networks, link prediction predicts missing links in current networks and new or dissolution links in future networks, is important for mining and analyzing the evolution of social networks. In the past decade, many works have been…
We determine which integral surgeries on a large class of circular chain links bound rational homology balls. Our key tool is the lattice-theoretic cubiquity obstruction recently developed by Greene and Owens. We discuss a practical method…