The tunnel number of the sum of n knots is at least n
From MaRDI portal
Abstract: We prove that the tunnel number of the sum of n knots is at least n.
Recommendations
Cited in
(29)- Additive invariants for knots, links and graphs in 3-manifolds
- The tunnel number and the cutting number with constituent handlebody-knots
- Some results on Heegaard splitting
- Hyperbolicity of the canonical genus two knots
- Tunnel number and bridge number of composite genus 2 spatial graphs
- On the degeneration of tunnel numbers under a connected sum
- Tunnel number one knots, m-small knots and the Morimoto conjecture
- Heegaard genera of annular 3-manifolds
- Tunnel numbers of knots
- Tunnel number degeneration under the connected sum of prime knots
- scientific article; zbMATH DE number 1265039 (Why is no real title available?)
- scientific article; zbMATH DE number 645854 (Why is no real title available?)
- Comparing Heegaard and JSJ structures of orientable 3-manifolds
- The amalgamation of high distance Heegaard splittings along tori
- Tunnel numbers of small knots do not go down under connected sum
- TANGLE DECOMPOSITIONS OF TUNNEL NUMBER ONE KNOTS AND LINKS
- There are Knots whose Tunnel Numbers go down under Connected Sum
- Examples of tunnel number one knots which have the property ‘1 + 1 = 3’
- Rank and genus of 3-manifolds
- Meridional destabilizing number of knots
- Two More Proofs that the Kinoshita Graph is Knotted
- Examples of amalgamated products.
- An integral invariant from the knot group
- Some sufficient conditions for tunnel numbers of connected sum of two knots not to go down
- Small difference between tunnel numbers of cable knots and their companions
- Equivariant unknotting numbers of strongly invertible knots
- An algorithm to determine the Heegaard genus of simple 3-manifolds with nonempty boundary
- Heegaard genera of high distance are additive under annulus sum
- On the tunnel number and the Morse-Novikov number of knots
This page was built for publication: The tunnel number of the sum of \(n\) knots is at least \(n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292679)
