相关论文: Arc-presentations of links. Monotonic simplificati…
In a recent work "Arc-presentation of links: Monotonic simplification" Ivan Dynnikov showed that each rectangular diagram of the unknot, composite link, or split link can be monotonically simplified into a trivial, composite, or split…
Trivial links are unique up to number of link components, but they can be hard to recognize from arbitrary diagrams. We define a new measure of the complexity of a link embedding, the crumple, and show how this may be used to measure…
This note has an experimental nature and contains no new theorems. We introduce certain moves for classical knot diagrams that for all the very many examples we have tested them on give a monotonic complete simplification. A complete…
This paper is expository and is accessible to students. We define simple invariants of knots or links (linking number, Arf-Casson invariants and Alexander-Conway polynomials) motivated by interesting results whose statements are accessible…
New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used…
We show that there are links whose individual components are concordant to the unknot, but which are not concordant to any link with unknotted components. We give examples in the topological category, and examples in the smooth category…
Noting that cycle diagrams of permutations visually resemble grid diagrams used to depict knots and links in topology, we consider the knot (or link) obtained from the cycle diagram of a permutation. We show that the permutations which…
We give a criterion of the semisimplicity of a p-adic unitary representation of a topological monoid by the reduction of the associated operator algebra.
A knot is an an embedding of a circle into three-dimensional space. We say that a knot is unknotted if there is an ambient isotopy of the embedding to a standard circle. By representing knots via planar diagrams, we discuss the problem of…
The recent proof by Bigelow and Krammer that the braid groups are linear opens the possibility of applications to the study of knots and links. It was proved by the first author and Menasco that any closed braid representative of the unknot…
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…
We show that there are only finitely many homogeneous links whose Conway polynomial has any given degree. Using this we give an example of an inhomogeneous, fibred knot. Secondly, we show how to compute the monodromy of a homogeneous link…
In this paper, we establish that the arc shift operation on a $n$-component virtual link diagram acts as an unknotting operation when the virtual link is $n$-homogeneous proper, aiding in the classification of \( n \)-component virtual…
Our main results concern changing an arbitrary plat presentation of a split or composite link to one which is obviously recognizable as being split or composite. Pocket moves, first described in \cite{unlinkviaplats}, are utilized -- a…
We construct links of arbitrarily many components each component of which is slice and yet are not concordant to any link with even one unknotted component. The only tool we use comes from the Alexander modules.
We prove that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard,…
These notes present two normal surface theory algorithms to detect the unknot and use the split-link algorithm to prove that the figure-eight knot is knotted.
Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.
We study hypergraph visualization via its topological simplification. We explore both vertex simplification and hyperedge simplification of hypergraphs using tools from topological data analysis. In particular, we transform a hypergraph to…
We prove that any diagram of the unknot with c crossings may be reduced to the trivial diagram using at most (236 c)^{11} Reidemeister moves. Moreover, every diagram in this sequence has at most (7 c)^2 crossings. We also prove a similar…