Question 3. Given a knot K \subset S3 , can we classify all of its characterising and non-characterising slopes?
Statement
Question 3. Given a knot K \subset S3 , can we classify all of its characterising and non-characterising slopes? Non-characterising slopes. There are many knots with non-characterising slopes. Brakes suggested a method of constructing these using the idea of gluing together a pair of knot complements [3]; this is realised in the following example [17]. Example 4. For any m, n, q \in Z \ {0} with m 6= n, there is a pair of distinct multiclasped doubles of double twist knots, K = W n (Tqm ) and K ′ = W m (Tqn ), and an orientation-preserving homeomorphism S3K (1/q) \sim = S3K ′ (1/q). Baker and Motegi showed that there are also knots for which infinitely many slopes are non-characterising [2]. The simplest of their examples is the hyperbolic knot 86 , for which no integer slopes are characterising. Characterising slopes. Every slope is characterising for the unknot [7, 8], as well as for the trefoils and figure eight knot [15]. Moreover, all but finitely many non-integer slopes are characterising for torus knots [14, 11]. Lackenby showed that for any knot K \subset S3 , there exists a constant C(K) for which every slope p/q \in [−1, 1] is characterising [9]; Sorya recently refined this in [16]. Inspired by the existence of C(K), the motivation for this work is to explicitly construct such a lower bound in some special cases. The purpose of this talk is to sketch the proofs of the following theorems from [17]. Theorem 5. Let K = P (C) be a satellite knot by a pattern P in whose comple- ment the length of the shortest geodesic is at least 0.136. Then every slope p/q with gcd(p, w) 6= 1, |q| \geq 36 is characterising for K. Theorem 6. Let K = W (C) be a Whitehead double and assume that the SnapPea census of the first n orientable, 2-cusped hyperbolic 3-manifolds ordered by volume is complete. Then every slope p/q with |p| 6= 1, |q| \geq \phi(n) is characterising for K. n 4 6 8 10 16 18 24 49 289 \phi(n) 44 33 31 29 28 27 26 25 24
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.