The weak simplification number inequality for branched covering surface-knots

Let (F,Γ)(F,\Gamma) be a branched covering surface-knot. The quantities uw(F,Γ)u_w(F,\Gamma) and u(F,Γ)u(F,\Gamma) denote, respectively, the weak simplification number and simplification number associated with (F,Γ)(F,\Gamma). Weak simplification inequality. One should have

uw(F,Γ)u(F,Γ).u_w(F,\Gamma)\leq u(F,\Gamma).

This corrects an earlier claim whose proof was incomplete; the authors explain that the relevant 1-handles can be added from the outset. The conjecture asserts that weak simplification never requires more 1-handles than simplification.

Sources & referencesView supporting material

Primary source

Inasa Nakamura, “Simplifying branched covering surface-knots by an addition of 1-handles with chart loops”, arXiv:1707.07888 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.