Related papers: Computing Chebyshev knot diagrams
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
We prove that every knot type in $\mathbb{R}^3$ can be parametrised by a smooth function $f:S^1\to\mathbb{R}^3$, $f(t)=(x(t),y(t),z(t))$ such that all derivatives $f^{(n)}(t)=(x^{(n)}(t),y^{(n)}(t),z^{(n)}(t))$, $n\in\mathbb{N}$,…
We compute the Jones polynomial for a three-parameter family of links, the twisted torus links of the form $T((p,q),(2,s))$ where $p$ and $q$ are coprime and $s$ is nonzero. When $s = 2n$, these links are the twisted torus knots…
Chebyshev polynomials of the first and second kind for a set K are monic polynomials with minimal L $\infty$-and L 1-norm on K, respectively. This articles presents numerical procedures based on semidefinite programming to compute these…
We study the variation of the Tait number of a closed space curve according to its different projections. The results are used to compute the writhe of a knot, leading to a closed formula in case of polygonal curves.
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 calculate the Chern-Simons invariants of the twist knot orbifolds using the Schl\"{a}fli formula for the generalized Chern-Simons function on the family of the twist knot cone-manifold structures. Following the general instruction of…
In an earlier paper the first author defined a non-commutative A-polynomial for knots in 3-space, using the colored Jones function. The idea is that the colored Jones function of a knot satisfies a non-trivial linear q-difference equation.…
We compute Vassiliev invariants up to order six for arbitrary pretzel knots, which depend on $g+1$ parameters $n_1,\ldots,n_{g+1}$. These invariants are symmetric polynomials in $n_1,\ldots,n_{g+1}$ whose degree coincide with their order.…
Vassiliev's knot invariants can be computed in different ways but many of them as Kontsevich integral are very difficult. We consider more visual diagram formulas of the type Polyak-Viro and give new diagram formula for the two basic…
This thesis develops some general calculational techniques for finding the orders of knots in the topological concordance group C. The techniques currently available in the literature are either too theoretical, applying to only a small…
The A-polynomial of a knot is defined in terms of SL(2,C) representations of the knot group, and encodes information about essential surfaces in the knot complement. In 2005, Dunfield-Garoufalidis and Boyer-Zhang proved that it detects the…
Given a quintic number field $K/\mathbb{Q}$, we study the set of irreducible trinomials, polynomials of the form $x^{5} + ax + b$, that have a root in $K$. We show that there is a genus four curve $C_{K}$ whose rational points are in…
We provide exact integral formulas for hyperbolic and spherical volumes of cone-manifolds whose underlying space is the $3$-sphere and whose singular set belongs to three infinite families of two-bridge knots: $C(2n,2)$ (twist knots),…
In 2000, Thomas Fink and Young Mao studied neck ties and, with certain assumptions, found 85 different ways to tie a neck tie. They gave a formal language which describes how a tie is made, giving a sequence of moves for each neck tie. The…
An invariant of knots is constructed from an integral for geometric braids due to Kohno and Kontsevich. It takes values in a quotient by a certain ideal of the algebra generated by chord diagrams over the circle.
A Vinnikov curve is a projective plane curve which can be written in the form det(xX+yY+zZ)=0 for X, Y and Z positive definite Hermitian n by n matrices. Given three n-tuples of positive real numbers, alpha, beta and gamma, there exist A, B…
Let $D$ be a knot diagram, and let ${\mathcal D}$ denote the set of diagrams that can be obtained from $D$ by crossing exchanges. If $D$ has $n$ crossings, then ${\mathcal D}$ consists of $2^n$ diagrams. A folklore argument shows that at…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…