I'm interested in a complexity question related to problems like the slice-ribbon problem.

To be specific, if $K \subset S^3$ is a knot, it might be non-trivial yet still bound a smoothly-embedded compact 2-dimensional ball $B \subset D^4$, where we consider $S^3 = \partial D^4$, and the ball is required to be properly embedded, meaning $B \cap D^4 = \partial B = K$. This is called a (smoothly) *slice knot*.

The slice-ribbon conjecture states that the only way this can happen is if you can find $B$ so that the distance function $d : D^4 \to \mathbb R$ given by $d(x) = |x|$ has no local maxima on $B$, i.e. it is Morse with only saddle points and local minima on $B$, and no other critical points.

- Q1: Do people have computations describing how many such saddle points you need for knots? In a ribbon diagram for the knot this is the number of components in the self-intersection set. I'm particularly interested in how this number would relate to a minimal-complexity planar knot diagram for the knot -- where you minimize crossing number or some other similar feature of a knot diagram. I want this complexity to be related to the number of tetrahedra you would need in a triangulation of $S^3$ so that the knot is a "normal curve" in the triangulation, meaning transverse to the triangulation and linear inside each tetrahedron.

More generally, I'm interested in the computational problem of finding candidate knots that are smoothly slice yet not ribbon. In 3-manifold theory there is a "normalization" process for normal surfaces in a triangulated manifold. This involves some isotopy, and embedded surgery. There is a much more primitive type of "normalization" process that works in any triangulated manifold (of any dimension) with respect to any submanifold -- simply subdivide the ambient triangulation and perturb the submanifold to be transverse. After some number of subdivisions, the submanifold will have to appear to be linear in each top-dimensional simplex. This is the key idea in Whitehead's proof that smooth manifolds admit triangulations.

- Q2: Are there any good estimates for how many subdivisions it takes to "normalize" a submanifold in the above Whitehead sense?

Q2 can be taken to be quite general. For example, for curves in surfaces, you can always normalize without any subdividing at all, all it takes is an isotopy. After minimizing the number of intersection points with the 1-skeleton of the triangulation, the only curve that needs more than a small isotopy (in the sense of the mapping space topology) would be the boundary of a disc embedded in the interior of a triangle.

For example, is there an interesting topological invariant of a knot that gives good lower-bounds on the number of tetrahedra you need to triangulate $S^3$ to make it appear to be locally linear? Things like the maximum of the curvature aren't topological, and I consider crossing number in a planar diagram to be not computationally-friendly enough.