Related papers: A 1-parameter approach to links in a solid torus
This article is about a natural distance function induced by smooth cobordisms between links. We show that the cobordism distance of torus links is determined by the profiles of their signature functions, up to a constant factor.
We introduce two common divisor graphs associated with a finite skew brace, based on its $\lambda$- and $\theta$-orbits. We prove that the number of connected components is at most two and the diameter of a connected component is at most…
A link stream is a set of triplets $(t, u, v)$ indicating that $u$ and $v$ interacted at time $t$. Link streams model numerous datasets and their proper study is crucial in many applications. In practice, raw link streams are often…
This paper studies the linking numbers of random links within the grid model. The linking number is treated as a random variable on the isotopy classes of 2-component links, with the paper exploring its asymptotic growth as the diagram size…
For an oriented surface link $S$, we can take a satellite construction called a 2-dimensional braid over $S$, which is a surface link in the form of a covering over $S$. We demonstrate that 2-dimensional braids over surface links are useful…
Curves in ${\mathbb R}^n$ for which the ratios between two consecutive curvatures are constant are characterized by the fact that their tangent indicatrix is a geodesic in a flat torus. For $n= 3,4$, spherical curves of this kind are also…
An oriented graph is a directed graph without any cycle of length at most 2. To push a vertex of a directed graph is to reverse the orientation of the arcs incident to that vertex. Klostermeyer and MacGillivray defined push graphs which are…
We showed in another paper [arXiv:1103.1759] that every connected graph can be realized as the cut locus of some point on some riemannian surface $S$. Here, criteria for the orientability of $S$ are given, and are applied to classify the…
We complement our study of 2-connectivity in directed graphs, by considering the computation of the following 2-vertex-connectivity relations: We say that two vertices v and w are 2-vertex-connected if there are two internally…
Gordon and Litherland showed that all compact, unoriented, possibly non-orientable surfaces in $S^3$ bounded by a link are realted by attaching/deleting tubes and half twisted bands. In this note we give an elementary proof for this result.
A long standing open conjecture states that if a link $\mathcal{K}$ is alternating, then its ropelength $L(\mathcal{K})$ is at least of the order $O(Cr(\mathcal{K}))$. A recent result shows that the maximum braid index of a link bounds the…
This is a sequel to the paper \cite{MO-mw} which identified maximally writhed algebraic links in $\rp^3$ and classified them topologically. In this paper we prove that all maximally writhed links of the same topological type are rigidly…
In recent years, discrete spaces such as graphs attract much attention as models for physical spacetime or as models for testing the spirit of non-commutative geometry. In this work, we construct the differential algebras for graphs by…
We prove that a sufficiently large surgery on any algebraic link is an L-space. For torus links we give a complete classification of integer surgery coefficients providing L-spaces.
We show that all sufficiently large (2k+3)-connected graphs of bounded tree-width are k-linked. Thomassen has conjectured that all sufficiently large (2k+2)-connected graphs are k-linked.
A knot (or link) diagram is said to be everywhere equivalent if all the diagrams obtained by switching one crossing represent the same knot (or link). We classify such diagrams of a closed 3-braid.
A fast method is presented for computing the topological entropy of braids on the torus. This work is motivated by the need to analyze large braids when studying two-dimensional flows via the braiding of a large number of particle…
We introduce Khovanov homology for ribbon graphs and show that the Khovanov homology of a certain ribbon graph embedded on the Turaev surface of a link is isomorphic to the Khovanov homology of the link (after a grading shift). We also…
Generic relative immersions of compact one-manifolds in the closed unit disk, i.e. divides, provide a powerful combinatorial framework, and allow a topological construction of fibered classical links, for which the monodromy diffeomorphism…
Consider an undirected graph whose edges are labeled invertibly in a group. When does every Eulerian trail from one fixed vertex to another have the same label? We give a precise structural answer to this question. Essentially, we show that…