相关论文: Arc-presentations of links. Monotonic simplificati…
We define a decomposition of link projections whose pieces we call atoroidal graphs. We describe a surgery operation on these graphs and show that all atoroidal graphs can be generated by performing surgery repeatedly on a family of well…
In this paper, we study knot diagrams for which the underlying graph has treewidth two. We give a linear time algorithm for the following problem: given a knot diagram of treewidth two, does it represent the unknot? We also show that for a…
Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…
We introduce a novel model of multipartite entanglement based on topological links, generalizing the graph/hypergraph entropy cone program. We demonstrate that there exist link representations of entropy vectors which provably cannot be…
We give a new, elementary proof of what we believe is the simplest known example of a ``natural'' problem in computational 3-dimensional topology that is $\mathsf{NP}$-hard -- namely, the \emph{Trivial Sublink Problem}: given a diagram $L$…
Alternative paths in a network play an important role in its functionality as they can maintain the information flow under node/link failures. In this paper we explore the navigation of a network taking into account the alternative paths…
We consider the bar complex of a monomial non-unital associative algebra $A=k \langle X \rangle / (w_1,...,w_t)$. It splits as a direct sum of complexes $B_w$, defined for any fixed monomial $w=x_1...x_n \in A$. We give a simple argument,…
We introduce natural language processing into the study of knot theory, as made natural by the braid word representation of knots. We study the UNKNOT problem of determining whether or not a given knot is the unknot. After describing an…
Node-link diagrams are a popular method for representing graphs that capture relationships between individuals, businesses, proteins, and telecommunication endpoints. However, node-link diagrams may fail to convey insights regarding graph…
We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…
We give a classification of $n$-component links up to $C_n$-move. In order to prove this classification, we characterize Brunnian links, and have that a Brunnian link is ambient isotopic to a band sum of trivial link and Milnor's links.
Topological entanglements are abundant, and often detrimental, in polymeric systems in biology and materials science. Here we theoretically investigate the topological simplification of knots by diffusing slip-links (SLs), which may…
We present an algebraic characterization of the complexity classes Logspace and NLogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is inspired from proof…
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
We prove that a simple knot in the lens space $L(p,q)$ fibers if and only if its order in homology does not divide any remainder occurring in the Euclidean algorithm applied to the pair $(p,q)$. One corollary is that if $p=m^2$ is a perfect…
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 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…
Our main result is a version of Birman's theorem about equivalence of plats, which does not involve stabilization, for the unlink. We introduce the pocket and flip moves, which modify a plat without changing its link type or bridge index.…
We consider surface links in the 4-space which are presented by the form of simple branched coverings over the standard torus, which we call torus-covering links. In this paper, we study unknotting numbers of torus-covering links. In some…
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…