Breadth–determinant conjecture for quasi-alternating links

Let LL be an oriented link. The breadth of its Jones polynomial VL(t)V_L(t), denoted by breadthVL(t)\operatorname{breadth} V_L(t), is the difference between the highest and lowest degrees of tt appearing in VL(t)V_L(t).

Breadth–determinant conjecture. If LL is a quasi-alternating link, then

breadthVL(t)det(L).\operatorname{breadth} V_L(t) \leq \det(L).

This conjecture is weaker than the crossing-number inequality c(L)det(L)c(L)\leq \det(L) because the breadth of the Jones polynomial is always at most the crossing number. It is known for all checked quasi-alternating links satisfying that crossing-number inequality, and is proved in the source for quasi-alternating closed 33-braids; its general status remains open.

Sources & referencesView supporting material

Primary source

Khaled Qazaqzeh and Nafaa Chbili, “A new obstruction of quasi-alternating links”, arXiv:1406.0279 (2014).

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.