Related papers: Arc-presentations of links. Monotonic simplificati…
We present two practical and widely applicable methods, including some criteria and a general procedure, for detecting Brunnian property of a link, if each component is known to be unknot. The methods are based on observation and handwork.…
In the present paper a criteria for a rectangular diagram to admit a simplification is given in terms of Legendrian knots. It is shown that there are two types of simplifications which are mutually independent in a sense. A new proof of the…
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…
We present new techniques to show hyperbolicity of links based on geometric/combinatorial topology. Our techniques are applicable to links that have at least one unknotted component. In particular, they are applicable to Brunnian links. We…
We give characterizations of the skein polynomial for links (as well as Jones and Alexander-Conway polynomials derivable from it), avoiding the usual "smoothing of a crossing" move. As by-products we have characterizations of these…
It is a major unsolved problem as to whether unknot recognition - that is, testing whether a given closed loop in R^3 can be untangled to form a plain circle - has a polynomial time algorithm. In practice, trivial knots (which can be…
Any knot diagram can be transformed into the unknot by a series of unknotting operations. This paper introduces the diagonal move, a novel unknotting operation that generalizes and unifies several existing moves. We prove that the diagonal…
Group presentations are implicit descriptions of 2-dimensional cell complexes with only one vertex. While such complexes are usually sufficient for topological investigations of groups, multi-vertex complexes are often preferable when the…
We give infinitely many $2$-component links with unknotted components which are topologically concordant to the Hopf link, but not smoothly concordant to any $2$-component link with trivial Alexander polynomial. Our examples are pairwise…
We enumerate and show tables of minimal diagrams for all prime knots up to the triple-crossing number equal to five. We derive a minimal generating set of oriented moves connecting triple-crossing diagrams of the same oriented knot. We also…
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…
This is an expository article on diagrammatic representations of knots and links in various settings via braids.
It is shown that the solutions of certain systems of nonlinear \"Orst-order recursions with polynomial right-hand sides may be rather easily ascertained, and display interesting evolutions in their ticking time variable (taking integer…
In this paper, a link diagram is said to be minimal if no Reidemeister move I or II can be applied to it to reduce the number of crossings. We show that for an arbitrary diagram D of a link without a trivial split component, a minimal…
We describe a method for generating minimal hard prime surface-link diagrams. We extend the known examples of minimal hard prime classical unknot and unlink diagrams up to three components and generate figures of all minimal hard prime…
It follows from earlier work of Silver-Williams and the authors that twisted Alexander polynomials detect the unknot and the Hopf link. We now show that twisted Alexander polynomials also detect the trefoil and the figure-8 knot, that…
We show that one can interweave an unknot into any non-alternating connected projection of a link so that the resulting augmented projection is alternating.
The use of complex networks as a modern approach to understanding the world and its dynamics is well-established in literature. The adjacency matrix, which provides a one-to-one representation of a complex network, can also yield several…
This paper explores the problem of unknotting closed braids and classical knots in mathematical knot theory. We apply evolutionary computation methods to learn sequences of moves that simplify knot diagrams, and show that this can be…
We present several application of simple topological arguments in problems of Kolmogorov complexity. Basically we use the standard fact from topology that the disk is simply connected. It proves to be enough to construct strings with some…