An algorithmic definition of Gabai width
From MaRDI portal
Publication:6148477
Abstract: We define the Wirtinger width of a knot. Then we prove the Wirtinger width of a knot equals its Gabai width. The algorithmic nature of the Wirtinger width leads to an efficient technique for establishing upper bounds on Gabai width. As an application, we use this technique to calculate the Gabai width of approximately 50000 tabulated knots.
Recommendations
Cites work
- Additivity of bridge numbers of knots
- Coxeter groups and meridional rank of links
- Foliations and the topology of 3-manifolds. III
- Knots are Determined by Their Complements
- Levelling an unknotting tunnel
- The first 1,701,936 knots
- The incompatibility of crossing number and bridge number for knot diagrams
- Thin position and bridge number for knots in the 3-sphere
- Thin position and essential planar surfaces
- Thin position and the recognition problem for \(S^ 3\)
- Width is not additive
- Wirtinger systems of generators of knot groups
This page was built for publication: An algorithmic definition of Gabai width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6148477)