Related papers: The slope conjecture for graph knots
We formulate a conjecture (already proven by A. Kricker) about the structure of Kontsevich integral of a knot. We describe its value in terms of the generating functions for the numbers of external edges attached to closed 3-valent…
Let $K_n$ be a complete graph with $n$ vertices. An embedding of $K_n$ in $S^3$ is called a spatial $K_n$-graph. Knots in a spatial $K_n$-graph corresponding to simple cycles of $K_n$ are said to be constituent knots. We consider the case…
The volume conjecture, formulated recently by H. Murakami and J. Murakami, is proved for the case of torus knots.
We confirm the AJ conjecture [Ga04] that relates the A-polynomial and the colored Jones polynomial for those hyperbolic knots satisfying certain conditions. In particular, we show that the conjecture holds true for some classes of…
Defect characterizes the depth of factorization of terms in differential (cyclotomic) expansions of knot polynomials, i.e. of the non-perturbative Wilson averages in the Chern-Simons theory. We prove the conjecture that the defect can be…
The Jones unknot conjecture states that the Jones polynomial distinguishes the unknot from nontrivial knots. We prove it for knots up to 23 crossings.
We show that the set of colored Jones polynomials and the set of generalized Alexander polynomials defined by Akutsu, Deguchi and Ohtsuki intersect non-trivially. Moreover it is shown that the intersection is (at least includes) the set of…
We give a combinatorial upper bound for the gonality of a curve that is defined by a bivariate Laurent polynomial with given Newton polygon. We conjecture that this bound is generically attained, and provide proofs in a considerable number…
This paper computes the Jones polynomial and the invariants obstructing cosmetic surgery which are derived from it for two infinite families of knots, proving they satisfy the Purely Cosmetic Surgery Conjecture. Both the method of…
Hoffmann-Ostenhof's Conjecture states that states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a $2$-regular subgraph. In this paper, we show that the conjecture holds for claw-free…
We study the asymptotic behaviors of the colored Jones polynomials of torus knots. Contrary to the works by R. Kashaev, O. Tirkkonen, Y. Yokota, and the author, they do not seem to give the volumes or the Chern-Simons invariants of the…
We show that for a twist knot, the A-polynomial can be obtained from recurrences for the summand in Masbaum's formula of the colored Jones polynomial. Our result supports the AJ conjecture due to S.Garoufalidis.
We propose a conjectural determination of the Gromov-Witten theory of a root stack along a smooth divisor. We verify our conjecture under an additional assumption.
We study decomposition into simple arcs (i. e., arcs without self-intersections) for diagrams of knots and spatial graphs. In this paper, it is proved in particular that if no edge of a finite spatial graph $G$ is a knotted loop, then there…
In this paper, we study the generalized volume conjecture for the colored Jones polynomials of links with complements containing more than one hyperbolic piece. First of all, we construct an infinite family of prime links by considering the…
We show that for a torus knot the SL(2;C) Chern-Simons invariants and the SL(2;C) twisted Reidemeister torsions appear in an asymptotic expansion of the colored Jones polynomial. This suggests a generalization of the volume conjecture that…
We show that there exist knots K in S^3 with g(E(K))=2 and g(E(K#K#K))=6. Together with Theorem~1.5 of [1], this proves existence of counterexamples to Morimoto's Conjecture (Conjecture 1.5 of [2]). This is a special case of…
We explore free knot diagrams, which are projections of knots into the plane which don't record over/under data at crossings. We consider the combinatorial question of which free knot diagrams give which knots and with what probability.…
Loebl, Koml\'os, and S\'os conjectured that any graph with at least half of its vertices of degree at least k contains every tree with at most k edges. We propose a version of this conjecture for skewed trees, i.e., we consider the class of…
Eisermann has shown that the Jones polynomial of a $n$-component ribbon link $L\subset S^3$ is divided by the Jones polynomial of the trivial $n$-component link. We improve this theorem by extending its range of application from links in…