Conjectured bounds for the simplification number of branched covering surface-knots

Let (F,Γ)(F,\Gamma) be a branched covering surface-knot of degree NN. Let uw(F,Γ)u_w(F,\Gamma) and u(F,Γ)u(F,\Gamma) denote the weak simplification number and simplification number, respectively. Define calg(Γ)c_{\mathrm{alg}}(\Gamma) as the sum of the absolute values of the numbers obtained, for i<ji<j and i,j{1,,N1}i,j\in\{1,\ldots,N-1\}, by subtracting the number of crossings of type cj,ic_{j,i} from the number of crossings of type ci,jc_{i,j}. Conjectured simplification bounds. One should have

u(F,Γ)uw(F,Γ)+calg(Γ),u(F,\Gamma)\leq u_w(F,\Gamma)+c_{\mathrm{alg}}(\Gamma),

and, successively,

u(F,Γ)max{uw(F,Γ),N1}+1,u(F,\Gamma)\leq\max\{u_w(F,\Gamma),N-1\}+1,

and

u(F,Γ)max{uw(F,Γ),N1}.u(F,\Gamma)\leq\max\{u_w(F,\Gamma),N-1\}.

The first inequality was previously proved only in a special case, while the latter bounds are proposed in connection with the proof of the preceding corollary. Their status remains open.

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.