Related papers: How Many Links Fit in a Box?
The Reidemeister theorem states that any link in $3$-space can be encoded by a diagram (a suitably decorated projection) on a plane, and provides a finite set of combinatorial moves relating two diagrams of the same link up to isotopy. In…
Alternative proof is given for an earlier presented result that if a link in 3-space bounds a compact oriented proper surface (without closed component) in the upper half 4-space, then the link bounds a ribbon surface in the upper half…
We answer a question posed by Fielder in [1] concerning two notions of crossing number for algebraic knots $K$ under Hopf fibration, one topological, denoted $h(K)$, the other coming from the realization of such knots around complex…
J.P. Levine introduced a clover link to investigate the indeterminacy of the Milnor invariants of a link. It is shown that for a clover link, the Milnor numbers of length at most $2k+1$ are well-defined if those of length at most $k$…
Predicting missing links in real networks is an important problem in network science to which considerable efforts have been devoted, giving as a result a vast plethora of link prediction methods in the literature. In this work, we take a…
Networks offer a powerful approach to modeling complex systems by representing the underlying set of pairwise interactions. Link prediction is the task that predicts links of a network that are not directly visible, with profound…
A differential geometric characterization of the braid-index of a link is found. After multiplication by 2pi, it equals the infimum of the sum of total curvature and total absolute torsion over holonomic representatives of the link. Upper…
It is well known that the minimum crossing number of an alternating link equals the number of crossings in any reduced alternating link diagram of the link. This remarkable result is an application of the Jones polynomial. In the case of…
The {\it crossing number} of a graph $G$ is the minimum number of pairwise intersections of edges in a drawing of $G$. Motivated by the recent work [Faria, L., Figueiredo, C.M.H. de, Sykora, O., Vrt'o, I.: An improved upper bound on the…
In this paper, we define invariants of links in terms of colorings of link diagrams and prove that these invariants coincide with various notions of widths of links with respect to the standard Morse function. Our formulations are…
In the 1970s, Williams developed an algorithm that has been used to construct and study modular links in the Lorenz template. We introduce an improved algorithm, which we call the bunch algorithm, to provide more insights into the geometry…
We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…
For each link type $K$ in the 3-sphere, we show that there is a polynomial $p_K$ such that any two diagrams of $K$ with $c_1$ and $c_2$ crossings differ by at most $p_K(c_1) + p_K(c_2)$ Reidemeister moves. As a consequence, the problem of…
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 define the basket number, the flat plumbing number and the flat plumbing basket number of a link. Then we provide some upperbounds for these plumbing numbers by using Seifert's algorithm. We study the relation between these plumbing…
We introduce and study the notion of filling links in 3-manifolds: a link L is filling in M if for any 1-spine G of M which is disjoint from L, $\pi_1(G)$ injects into $\pi_1(M\smallsetminus L)$. A weaker "k-filling" version concerns…
We introduce the $SU(N)$ Casson-Lin invariants for links $L$ in $S^3$ with more than one component. Writing $L = \ell_1 \cup \cdots \cup \ell_n$, we require as input an $n$-tuple $(a_1,\ldots, a_n) \in {\mathbb Z}^n$ of labels, where $a_j$…
If a hyperbolic link has a prime alternating diagram D, then we show that the link complement's volume can be estimated directly from D. We define a very elementary invariant of the diagram D, its twist number t(D), and show that the volume…
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…
It is natural to ask how many isotopy classes of embedded essential surfaces lie in a given 3-manifold. The first bounds on the number of such surfaces were exponential, using normal surfaces. More recently, by restricting to alternating…