Related papers: A table of boundary slopes of Montesinos knots
The warping degree of an oriented knot diagram is the minimal number of crossing changes which are required to obtain a monotone knot diagram from the diagram. The minimal warping degree of a knot is the minimal value of the warping degree…
There has been significant research dedicated towards computing the crossing numbers of families of graphs resulting from the Cartesian products of small graphs with arbitrarily large paths, cycles and stars. For graphs with four or fewer…
We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.
A virtual link may be defined as an equivalence class of diagrams, or alternatively as a stable equivalence class of links in thickened surfaces. We prove that a minimal crossing virtual link diagram has minimal genus across representatives…
We introduce a new polynomial invariant of virtual knots and links and use this invariant to compute a lower bound on the virtual crossing number and the minimal surface genus.
It is proved that the rectilinear crossing number of every graph with bounded tree-width and bounded degree is linear in the number of vertices. **** This paper has been withdrawn by the author. **** The results have been superseeded by the…
In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the…
In formulating a non-orientable analogue of the Milnor Conjecture on the $4$-genus of torus knots, Batson developed an elegant construction that produces a smooth non-orientable spanning surface in $B^4$ for a given torus knot in $S^3$.…
This paper presents some finiteness results for the number of boundary slopes of immersed essential surfaces of given genus g in a compact 3-manifold with torus boundary. In the case of hyperbolic 3-manifolds we obtain uniform quadratic…
We show, for every positive integer $n$, there is an alternating knot having a boundary slope with denominator $n$. We make use of Kabaya's method for boundary slopes and the layered solid torus construction introduced by Jaco and…
The classical Crossing Lemma by Ajtai et al.~and Leighton from 1982 gave an important lower bound of $c \frac{m^3}{n^2}$ for the number of crossings in any drawing of a given graph of $n$ vertices and $m$ edges. The original value was $c=…
We investigate the minimal number of links and knots in complete partite graphs. We provide exact values or bounds on the minimal number of links for all complete partite graphs with all but 4 vertices in one partition, or with 9 vertices…
The alternating knots, links and twists projected on the $S_2$ sphere were identified with the phase space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossings, the edges correspond…
We present an atlas of Legendrian knots in standard contact three-space. This gives a conjectural Legendrian classification for all knots with arc index at most 9, including alternating knots through 7 crossings and nonalternating knots…
Region crossing change for a knot or a proper link is an unknotting operation. In this paper, we provide a sharp upper bound on the region unknotting number for a large class of torus knots and proper links. Also, we discuss conditions on…
The crossing number of a graph is the minimum number of edge crossings that a graph can have when drawn in the plane. Determining this number, known as the Crossing Number problem, is a celebrated problem in combinatorial optimization. It…
This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $n\times n\times n$ stochastic tensors (i.e., triply stochastic arrays of dimension $n$). By using known results on polytopes (i.e.,…
Conjecturally, a knot in the 3-sphere has only finitely many non-integer non-characterizing slopes. We verify this conjecture for all knots with knot Floer homology satisfying certain simplicity conditions. The class of knots satisfying our…
Using computational techniques we tabulate prime knots up to five crossings in the solid torus and the infinite family of lens spaces $L(p,q)$. For these knots we calculate the second and third skein module and establish which prime knots…
The crossing number of a graph $G$ denotes the minimum number of crossings in any planar drawing of $G$. In this short note, we confirm a long-standing conjecture posed by Pach, Spencer, and T\'oth over 25 years ago, establishing an optimal…