Breadth–determinant conjecture for quasi-alternating links
Breadth–determinant conjecture for quasi-alternating links
Let be an oriented link. The breadth of its Jones polynomial , denoted by , is the difference between the highest and lowest degrees of appearing in .
Breadth–determinant conjecture. If is a quasi-alternating link, then
This conjecture is weaker than the crossing-number inequality 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 -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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.