Related papers: Coherent band pathways between knots and links
Tied links and the tied braid monoid were introduced recently by the authors and used to define new invariants for classical links. Here, we give a version purely algebraic-combinatoric of tied links. With this new version we prove that the…
Chord diagrams and related enlacement graphs of alternating knots are enhanced to obtain complete invariant graphs including chirality detection. Moreover, the equivalence by common enlacement graph is specified and the neighborhood graph…
We use Heegaard Floer homology to give obstructions to unknotting a knot with a single crossing change. These restrictions are particularly useful in the case where the knot in question is alternating. As an example, we use them to classify…
A {\it stuck knot} is a knot diagram containing designated crossings, called {\it stuck crossings}, whose incident strands are required to remain locally non-separable. These rigidity constraints restrict the allowable ambient isotopies and…
A knot is a closed loop in space without self-intersection. Two knots are equivalent if there is a self homeomorphism of space bringing one onto the other. An arc presentation is an embedding of a knot in the union of finitely many half…
Shake slice generalizes the notion of a slice link, naturally extending the notion of shake slice knots to links. There is also a relative version, shake concordance, that generalizes link concordance. We show that if two links are shake…
RNA molecules are known to form complex secondary structures including pseudoknots. A systematic framework for the enumeration, classification and prediction of secondary structures is critical to determine the biological significance of…
The alternating knots, links and twists projected on the $S_2$ sphere were identified with the phase space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossings, the edges correspond…
While the problem of computing the genus of a knot is now fairly well understood, no algorithm is known for its four-dimensional variants, both in the smooth and in the topological locally flat category. In this article, we investigate a…
We describe a family of recursive methods for the synthesis of qubit permutations on quantum computers with limited qubit connectivity. Two objectives are of importance: circuit size and depth. In each case we combine a scalable heuristic…
We extend the list of known band structure topologies to include a large family of hyperbolic nodal links and knots, occurring both in conventional Hermitian systems where their stability relies on discrete symmetries, and in the…
Detection of curvilinear structures in images has long been of interest. One of the most challenging aspects of this problem is inferring the graph representation of the curvilinear network. Most existing delineation approaches first…
A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove…
An interference experiment with entangled particles is theoretically analyzed, where one of the entangled pair (particle 1) goes through a multi-slit before being detected at a fixed detector. In addition, one introduces a mechanism for…
Circuit knitting is the process of partitioning large quantum circuits into smaller subcircuits such that the result of the original circuits can be deduced by only running the subcircuits. Such techniques will be crucial for near-term and…
This project explores the mathematical study of knots and links in topology, focusing on differentiating between the two-component Unlink and the Hopf Link using a computational tool named LINKAGE. LINKAGE employs the linking number,…
We discuss relations among various positivities of knots and links, such as strong quasipositivity and quasipositivity. We give several pieces of supporting evidence for conjectural statements concerning these positivities and the defect of…
Dynamic processes on networks, be it information transfer in the Internet, contagious spreading in a social network, or neural signaling, take place along shortest or nearly shortest paths. Unfortunately, our maps of most large networks are…
We make use of the 3D nature of knots and links to find savings in computational complexity when computing knot invariants such as the linking number and, in general, most finite type invariants. These savings are achieved in comparison…
We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are…