Related papers: An Algorithmic Definition of Gabai Width
We define cylinder knots as billiard knots in a cylinder. We present a necessary condition for cylinder knots: after dividing cylinder knots by possible rotational symmetries we obtain ribbon knots. We obtain an upper bound for the number…
Weaving knots are alternating knots with the same projection as torus knots, and were conjectured by X.-S. Lin to be among the maximum volume knots for fixed crossing number. We provide the first asymptotically correct volume bounds for…
We estimate from above the set of knots, $\Omega(n,\mu)$, generated by closure of n-string 1+1- and 2+1-dimensional braids of irreducible length $\mu$ ($\mu>>1$) in the limit n>>1.
We obtain a bound on the girth g of a quaternion unit gain graph in terms of the rank r of its adjacency matrix. In particular, we show that g <= r + 2 and characterize all quaternion unit gain graphs for which g = r+2. This extends…
We introduce an unknotting-type number of knot projections that gives an upper bound of the crosscap number of knots. We determine the set of knot projections with the unknotting-type number at most two, and this result implies classical…
The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that edge-bandwidth is at least as large as bandwidth for every…
The lattice stick number of knots is defined to be the minimal number of straight sticks in the cubic lattice required to construct a lattice stick presentation of the knot. We similarly define the lattice stick number $s_{L}(G)$ of spatial…
We define the concordance crosscap number of a knot as the minimum crosscap number among all the knots concordant to the knot. The four-dimensional crosscap number is the minimum first Betti number of non-orientable surfaces smoothly…
The ropelength of a knot is the minimum contour length of a tube of unit radius that traces out the knot in three dimensional space without self-overlap, colloquially the minimum amount of rope needed to tie a given knot. Theoretical upper…
We introduce the notion of wen knots, and prove that the set of wen knots is a proper subset of the set of extended welded knots. Furthermore we prove that the complementary subset consists of welded knots up to horizontal mirror…
Let $G$ be a connected undirected graph on $n$ vertices with no loops but possibly multiedges. Given an arithmetical structure $(\textbf{r}, \textbf{d})$ on $G$, we describe a construction which associates to it a graph $G'$ on $n-1$…
We introduce two numerical invariants, the waist and the trunk of knots. The waist of a closed incompressible surface in the complement of a knot is defined as the minimal intersection number of all compressing disks for the surface in the…
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…
We introduce the warping matrix which is a new description of oriented knots from a viewpoint of warping degree.
Knitting, an ancient fiber art, creates a structured fabric consisting of loops or stitches. Publishing hand knitting patterns involves lengthy testing periods and numerous knitters. Modeling knitting patterns with graphs can help expedite…
We show that every knot has a checkerbord diagram and that every knot is the closure of a rosette braid. We define Fourier knots of type (n_1, n_2, n_3) as knots which have parametrizations where each coordinate function x_i(t) is a finite…
This paper employs various computational techniques to determine the bridge numbers of both classical and virtual knots. For classical knots, there is no ambiguity of what the bridge number means. For virtual knots, there are multiple…
We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.
Using Kauffman's model of flat knotted ribbons, we demonstrate how all regular polygons of at least seven sides can be realised by ribbon constructions of torus knots. We calculate length to width ratios for these constructions thereby…
As a result of the interaction of rapid development and competition in information technologies, the reliability of a network and how solid it remains is important. It is called the hat vulnerability of the network to measure the endurance…