Strict triple-crossing lower bound for nonmonic Alexander polynomials

Let KK be a knot. Write c3(K)c_3(K) for its triple-crossing number and let Δ(K)\Delta(K) denote its Alexander polynomial; write breadth(Δ(K))\operatorname{breadth}(\Delta(K)) for the breadth of this polynomial. Strict lower-bound conjecture. If Δ(K)\Delta(K) is not monic, then

c3(K)>breadth(Δ(K)).c_3(K)>\operatorname{breadth}(\Delta(K)).

The paper motivates this conjecture using the known bound c3(K)2gc(K)c_3(K)\geq 2g_c(K), where gc(K)g_c(K) is the canonical genus, together with 2gc(K)breadth(Δ(K))2g_c(K)\geq \operatorname{breadth}(\Delta(K)). The proposed strict inequality is based on the authors' experiments and is not resolved in the supplied text.

Sources & referencesView supporting material

Primary source

Michał Jabłonowski, “Tabulation of knots up to five triple-crossings and moves between oriented diagrams”, arXiv:2105.10921 (2021).

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.