Related papers: The strong slope conjecture for cablings and conne…
The Slope Conjecture proposed by Garoufalidis asserts that the degree of the colored Jones polynomial determines a boundary slope, and its refinement, the Strong Slope Conjecture proposed by Kalfagianni and Tran asserts that the linear term…
The Slope Conjecture proposed by Garoufalidis asserts that the degree of the colored Jones polynomial determines a boundary slope, and its refinement, the Strong Slope Conjecture proposed by Kalfagianni and Tran asserts that the linear term…
The (Strong) Slope Conjecture relates the degree of the colored Jones polynomial of a knot to certain essential surfaces in the knot complement. We verify the Slope Conjecture and the Strong Slope Conjecture for 3-string Montesinos knots…
We study near-alternating links whose diagrams satisfy conditions generalized from the notion of semi-adequate links. We extend many of the results known for adequate knots relating their colored Jones polynomials to the topology of…
We observe that the strong slope conjecture implies that the degree of the colored Jones polynomial detects all torus knots. As an application we obtain that an adequate knot that has the same colored Jones polynomial degrees as a torus…
The slope conjecture proposed by Garoufalidis asserts that the Jones slopes given by the sequence of degrees of the colored Jones polynomials are boundary slopes. We verify the slope conjecture for graph knots, i.e. knots whose Gromov…
We prove that transversal non-simplicity is preserved under taking connect sum, generalizing Vertesi's result.
The Slope Conjecture relates the degree of the colored Jones polynomial to the boundary slopes of a knot. We verify the Slope Conjecture and the Strong Slope Conjecture for Montesinos knots $M(\frac{1}{r},\frac{1}{s-\frac{1}{u}},\frac{1}{t}…
We continue our study of the degree of the colored Jones polynomial under knot cabling started in "Knot Cabling and the Degree of the Colored Jones Polynomial" (arXiv:1501.01574). Under certain hypothesis on this degree, we determine how…
The slope conjecture gives a precise relation between the degree of the colored Jones polynomial of a knot and the boundary slopes of essential surfaces in the knot complement. In this note we propose a generalization of the slope…
We study the behavior of the degree of the colored Jones polynomial and the boundary slopes of knots under the operation of cabling. We show that, under certain hypothesis on this degree, if a knot $K$ satisfies the Slope Conjecture then a…
We describe a normal surface algorithm that decides whether a knot, with known degree of the colored Jones polynomial, satisfies the Strong Slope Conjecture. We also discuss possible simplifications of our algorithm and state related open…
In this paper, we study Legendrian realizations of cable links of knot types that are uniformly thick but not Legendrian simple, extending prior work of Dalton, the second author, and Traynor. This leads to new phenomena, such as stabilized…
In this survey we overview known results on the strong subgraph $k$-connectivity and strong subgraph $k$-arc-connectivity of digraphs. After an introductory section, the paper is divided into four sections: basic results, algorithms and…
We study a canonical spanning surface obtained from a knot or link diagram depending on a given Kauffman state, and give a sufficient condition for the surface to be essential. By using the essential surface, we can see the triviality and…
A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…
A construction of a spatial graph from a strongly invertible knot was developed by the second author, and a necessary and sufficient condition for the given spatial graph to be hyperbolic was provided as well. The condition is improved in…
We present an explicit connected spanning structure that appears in a random graph just above the connectivity threshold with high probability.
Either fibered knots supporting the tight contact structure are unique in their smooth concordance class or there exists a fibered counterexample to the Slice-Ribbon Conjecture.
We prove an explicit cabling formula for the colored Jones polynomial. As an application we prove the volume conjecture for all zero volume knots and links, i.e. all knots and links that are obtained from the unknot by repeated cabling and…