Related papers: Rail knotoids
A $3$-$tangle$ $T$ is the disjoint union of $3$ properly embedded arcs in the unit 3-ball; it is called rational if there is a homeomorphism of pairs from $(B^3,T)$ to $(D^2\times I,\{x_1,x_2,x_3\}\times I)$. Two rational 3-tangles $T$ and…
The notion of an upward plane graph in graph theory and that of a progressive plane graph (or plane string diagram) in category theory are essentially the same thing. In this paper, we combine the ideas in graph theory and category theory…
In "Tunnel one, fibered links", the second author showed that the tunnel of a tunnel number one, fibered link can be isotoped to lie as a properly embedded arc in the fiber surface of the link. In this paper, we analyze how the arc behaves…
We prove that two chains of linear mappings are topologically isomorphic if and only if they are linearly isomorphic.
In the context of magnetic fields generated by wires, we study the connection between the topology of the wire and the topology of the magnetic lines. We show that a generic knotted wire has a magnetic line of the same knot type, but that…
In 1983 Conway and Gordon proved that any embedding of the complete graph $K_7$ into $\mathbb{R}^3$ contains at least one nontrivial knot as its Hamiltonian cycle. After their work knots (also links) are considered as intrinsic properties…
In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…
We show that two simple, separable, nuclear and $\mathcal{Z}_0$-stable $\mathrm{C}^\ast$-algebras are isomorphic if they are trace-preservingly homotopy equivalent. This result does not assume the UCT and can be viewed as a tracial stably…
The present paper is a review of the current state of Graph-Link Theory (graph-links are also closely related to homotopy classes of looped interlacement graphs), dealing with a generalisation of knots obtained by translating the…
We establish a novel connection between algebraic number theory and knot theory. We show that the number of equivalence classes of integral binary quadratic forms of discriminant $t^2 - 4$ (for $t\neq \pm 2$) is equal to the number of…
Steinhaus conjectured that every closed oriented $C^1$-curve has a pair of anti-parallel tangents. Porter disproved the conjecture by showing that there exist curves with no anti-parallel tangents. Colin Adams rised the question of whether…
We introduce a simple combinatorial way, which we call a rectangular diagram of a surface, to represent a surface in the three-sphere. It has a particularly nice relation to the standard contact structure on $\mathbb S^3$ and to rectangular…
We prove affirmatively the conjecture raised by J. Mostovoy; the space of short ropes is weakly homotopy equivalent to the classifying space of the topological monoid (or category) of long knots in $\mathbb{R}^3$. We make use of techniques…
Mazur, Kapranov, Reznikov, and others developed ``Arithmetic Topology,'' a theory describing some surprising analogies between 3-dimensional topology and number theory, which can be summarized by saying that knots are like prime numbers. We…
This paper examines the relationship between the knotting of an embedded surface in $\R^3$ and the knotting of its fold curves, formed by the singular set of projection to a plane. The first result shows that every surface, no matter how…
We determine geodesics in $\mathbb{R}_{\infty}^n$ (i.e. $(\mathbb{R}^n, d_{\infty})$) and by using this, classify planes up to isometry in $\mathbb{R}_{\infty}^3$.
Diagrams enable the use of various algebraic and geometric tools for analysing and classifying knots. In this paper we introduce a new diagrammatic representation of triply periodic entangled structures (TP tangles), which are embeddings of…
We study decomposition into simple arcs (i. e., arcs without self-intersections) for diagrams of knots and spatial graphs. In this paper, it is proved in particular that if no edge of a finite spatial graph $G$ is a knotted loop, then there…
We present parity conditions under which a toy rail network is one-way, i.e., whether a direction can be assigned across the network so that all train journeys are completely consistent with it or completely consistent with its opposite. We…
A zigzag in a plane graph is a circuit of edges, such that any two, but no three, consecutive edges belong to the same face. A railroad in a plane graph is a circuit of hexagonal faces, such that any hexagon is adjacent to its neighbors on…