Related papers: Evolution of unknotting strategies for knots and b…
The slicing number of a knot, $u_s(K)$, is the minimum number of crossing changes required to convert $K$ to a slice knot. This invariant is bounded above by the unknotting number and below by the slice genus $g_s(K)$. We show that for many…
In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…
We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1…
In this article, we propose the approach to procedural optimization of a neural network, based on the combination of information theory and braid theory. The network studied in the article implemented with the intersections between the…
We study several related models of self-avoiding polygons in a tubular subgraph of the simple cubic lattice, with a particular interest in the asymptotics of the knotting statistics. Polygons in a tube can be characterised by a finite…
The main result of this paper is a negative answer to the question: are all transversal knot types transversally simple? An explicit infinite family of examples is given of closed 3-braids that define transversal knot types that are not…
We discuss different invariants of knots and links that depend on a primitive root of unity. We clarify the definitions of existing invariants with the Reshetikhin-Turaev method, present the generalization of ADO invariants to…
These notes were prepared to supplement the talk that I gave on Feb 19, 2004, at the First East Asian School of Knots and Related Topics, Seoul, South Korea. In this article I review aspects of the interconnections between braids, knots and…
We consider knot theories possessing a {\em parity}: each crossing is decreed {\em odd} or {\em even} according to some universal rule. If this rule satisfies some simple axioms concerning the behaviour under Reidemeister moves, this leads…
The weights of a neural network are typically initialized at random, and one can think of the functions produced by such a network as having been generated by a prior over some function space. Studying random networks, then, is useful for a…
We define a new kind of Gauss diagrams to describe knots in the solid torus with projections in the annulus. We see that it provides an efficient tool for showing that a knot diagram can be fully recovered from its decorated Gauss diagram,…
Over the years, several Bridges papers have delved into the concept of danceability of a knot diagram. Inspired by dancing on non-orientable surfaces, in this paper, we expand danceability to twisted virtual knot diagrams. This paper is…
In this article, we define an independence system for a classical knot diagram and prove that the independence system is a knot invariant for alternating knots. We also discuss the exchange property for minimal unknotting sets. Finally, we…
Knots are fascinating topological structures that have been observed in various contexts, ranging from micro-worlds to macro-systems, and are conjectured to play a fundamental role in their respective fields. In order to characterize their…
We give a number theoretic proof of the integrality of certain BPS invariants of knots. The formulas for these numbers are sums involving binomial coefficients and the M\"obius function. We also prove a conjecture about further divisibility…
This paper discusses some geometric ideas associated with knots in real projective 3-space $\mathbb{R}P^3$. These ideas are borrowed from classical knot theory. Since knots in $\mathbb{R}P^3$ are classified into three disjoint classes, -…
The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections. To prove the existence of the algorithm, we…
In this paper a classification of Reidemeister moves, which is the most refined, is introduced. In particular, this classification distinguishes some $\Omega_3$-moves that only differ in how the three strands that are involved in the move…
We study and give examples of braided groupoids, and, a fortiori, non-degenerate solutions of the quiver-theoretical braid equation.
This paper visualizes a knot reduction algorithm