Related papers: Crossing Number Bound in Knot Mosaics

The warping degree of an oriented knot diagram is the minimal number of crossings which we meet as an under-crossing first when we travel along the diagram from a fixed point. The warping degree of a knot projection is the minimal value of…

Meier and Zupan introduced bridge trisections of surface links in $S^4$ as a 4-dimensional analogue to bridge decompositions of classical links, which gives a numerical invariant of surface links called the bridge number. We prove that…

The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. One of the most studied types of drawings in this area are the…

The crossing number $cr(G)$ of a graph $G=(V,E)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$-planar crossing number of $G$, $cr_k(G)$, is defined as the minimum of…

We show that every nonzero integer occurs in the denominator of a boundary slope for infinitely many (1,1)-knots and that infinitely many (1,1)-knots have boundary slopes of arbitrarily small difference. Specifically, we prove that for any…

Experimental data from Dunfield et al using random grid diagrams suggests that the genus of a knot grows linearly with respect to the crossing number. Using billiard table diagrams of Chebyshev knots developed by Koseleff and Pecker and a…

We give infinitely many examples of 2-bridge knots for which the topological and smooth slice genera differ. The smallest of these is the 12-crossing knot $12a255$. These also provide the first known examples of alternating knots for which…

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…

The splitting number of a link is the minimum number of crossing changes between distinct components that is required to convert the link into a split link. We provide a bound on the splitting number in terms of the four-genus of related…

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.…

For a virtual knot $K$ and an integer $r\geq 0$, the $r$-covering $K^{(r)}$ is defined by using the indices of chords on a Gauss diagram of $K$. In this paper, we prove that for any finite set of virtual knots $J_0,J_2,J_3,\dots,J_m$, there…

We study relations between unknotting number and crossing number of a spatial embedding of a handcuff-graph and a theta curve. It is well known that for any non-trivial knot $K$ twice the unknotting number of $K$ is less than or equal to…

Correlated interference is calculated for a microscopic particle retro-reflecting from two spatially separated scatterers that are free to move, all three of which are treated as quantum bodies: the positions of the particle traversing this…

A plane drawing of a graph is {\em cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoints) any of these circles. The {\em cylindrical crossing…

We present the complete classification of the subgroup of the classical knot concordance group generated by knots with eight or fewer crossings. Proofs are presented in summary. We also describe extensions of this work to the case of nine…

Previous work used polygonal realizations of knots to reduce the problem of computing the superbridge number of a realization to a linear programming problem, leading to new sharp upper bounds on the superbridge index of a number of knots.…

For a knot K the cube number is a knot invariant defined to be the smallest n for which there is a cube diagram of size n for K. We will show that the cube number detects chirality in all cases computed thus far, and distinguishes certain…

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…

We show for an alternating knot the minimal boundary slope of an essential spanning surface is given by the signature plus twice the minimum degree of the Jones polynomial and the maximal boundary slope of an essential spanning surface is…

We show that there is a knot satisfying the property that for each minimal crossing number diagram of the knot and each single crossing of the diagram, changing the crossing results in a diagram for a knot whose unknotting number is at…