Related papers: An Algorithmic Definition of Gabai Width
While the problem of knot classification is far from solved, it is possible to create computer programs that can be used to tabulate knots up to a desired degree of complexity. Here we discuss the main ideas on which such programs can be…
We study the formation of knots on a macroscopic ball-chain, which is shaken on a horizontal plate at 12 times the acceleration of gravity. We find that above a certain critical length, the knotting probability is independent of chain…
We discuss the polynomial representation for long knots and elaborate on how to obtain them with a bound on degrees of the defining polynomials, for any knot-type.
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…
Cages ($r$-regular graphs of girth $g$ and minimum order) and their variants have been studied for over seventy years. Here we propose a new variant, "weighted cages". We characterize their existence; for cases $g=3,4$ we determine their…
The study of knot mosaics is based upon representing knot diagrams using a set of tiles on a square grid. This branch of knot theory has many unanswered questions, especially regarding the efficiency with which we draw knots as mosaics.…
Knotted and tangled structures frequently appear in physical fields, but so do mechanisms for untying them. To understand how this untying works, we simulate the behavior of 1,458 superfluid vortex knots of varying complexity and scale in…
Every classical or virtual knot is equivalent to the unknot via a sequence of extended Reidemeister moves and the so-called forbidden moves. The minimum number of forbidden moves necessary to unknot a given knot is an invariant we call the…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
We introduce the arithmetic width of a convex body, defined as the number of distinct values a linear functional attains on the lattice points within the body. Arithmetic width refines lattice width by detecting gaps in the lattice point…
The list of knots with up to 10 crossings is commonly referred to as the Rolfsen Table. This paper presents a way to generate the Rolfsen table in a simple, clear, and reproducible manner. The methods we use are similar to those used by J.…
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph $G$ is equivalent to…
In this paper, we investigate three geometrical invariants of knots, the height, the trunk and the representativity. First, we give a conterexample for the conjecture which states that the height is additive under connected sum of knots. We…
It has been conjectured that the geometric invariant of knots in 3-space called the width is nearly additive. That is, letting w(K) in N denote the width of a knot K in S^3, the conjecture is that w(K # K') = w(K) + w(K') - 2. We give an…
We relate certain abelian invariants of a knot, namely the Alexander polynomial, the Blanchfield form, and the Arf invariant, to intersection data of a Whitney tower in the 4-ball bounded by the knot. We also give a new 3-dimensional…
We discuss the possibility of the existence of finite algorithms that may give distinct knot classes. In particular we present two attempts for such algorithms which seem promising, one based on knot projections on a plane, the other on…
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones…
Every link is shown to be presentable as a boundary of an unknotted flat banded surface. A (flat) banded link is defined as a boundary of an unknotted (flat) banded surface. A link's (flat) band index is defined as the minimum number of…
The unknotting number of knots is a difficult quantity to compute, and even its behavior under basic satelliting operations is not understood. We establish a lower bound on the unknotting number of cable knots and iterated cable knots…
We prove that the number of iterations taken by the Weisfeiler-Leman algorithm for configurations coming from Schreier graphs is closely linked to the diameter of the graphs themselves: an upper bound is found for general Schreier graphs,…