The condensed three-braid Jones polynomial coefficient conjecture

About 15 years old · traced to

Let β\beta be a condensed positive three-braid word, let w=w(β)w=w(\beta), and write rr for the number of syllables in β\beta. Define Vβ^∗(t)V_{\widehat{\beta}}^*(t) and Vβ^∗∗(t)V_{\widehat{\beta}}^{**}(t) by the displayed decomposition below. Here ϵn=(−1)n\epsilon_n=(-1)^n, [P]j[P]_j denotes the coefficient of tjt^j in a polynomial PP, and an AC polynomial is one whose nonzero coefficients alternate in sign. A condensed three-braid has either no trivial syllables or one trivial syllable whose two adjacent syllables each have length at least three.

Condensed three-braid conjecture. One has

Vβ^∗(t)=ϵw(1+t2)+t2Vβ^∗∗(t),V_{\widehat{\beta}}^*(t)=\epsilon_w(1+t^2)+t^2V_{\widehat{\beta}}^{**}(t),

and the following properties hold: the sign of [Vβ^∗∗]j[V_{\widehat{\beta}}^{**}]_j is ϵr+1+j+w\epsilon_{r+1+j+w}, so Vβ^∗∗V_{\widehat{\beta}}^{**} is an AC polynomial; if β\beta has no trivial syllables, then

deg⁡Vβ^∗∗(t)=w−r−1,[Vβ^∗∗]max⁡=1;\deg V_{\widehat{\beta}}^{**}(t)=w-r-1,\qquad [V_{\widehat{\beta}}^{**}]_{\max}=1;

if β\beta has one trivial syllable, then

deg⁡Vβ^∗∗(t)=w−r−2,[Vβ^∗∗]max⁡=−1;\deg V_{\widehat{\beta}}^{**}(t)=w-r-2,\qquad [V_{\widehat{\beta}}^{**}]_{\max}=-1;

and

[Vβ^∗∗]j≠0exactly whenj∈[w−2−deg⁡Vβ^∗∗(t), deg⁡Vβ^∗∗(t)].[V_{\widehat{\beta}}^{**}]_j\neq 0\quad\text{exactly when}\quad j\in[w-2-\deg V_{\widehat{\beta}}^{**}(t),\,\deg V_{\widehat{\beta}}^{**}(t)].

The claim gives a precise alternating-sign and support description for the residual part of the Jones polynomial of condensed positive three-braid closures. The supplied text does not establish whether this statement is proved or remains open.

References

Primary source

David Emmes, “The Jones polynomial and related properties of some twisted links”, arXiv:1108.1523 (2011).

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.