Characterization of crossing matrices of positive pure braids

About 1 year old · traced to

Let n∈Nn\in\mathbb{N}, and let MM be an n×nn\times n matrix. A positive pure braid is a pure braid admitting a diagram with only positive crossings, and its crossing matrix records the algebraic number of crossings between each pair of strands. A symmetric matrix is T0 when, for every i<ji<j, M(i,j)=0M(i,j)=0 implies that there is some kk with i<k<ji<k<j such that M(i,k)>0M(i,k)>0 or M(k,j)>0M(k,j)>0.

Characterization conjecture. An n×nn\times n matrix MM is the crossing matrix of some positive pure braid if and only if MM is a non-negative integer T0 symmetric matrix.

The conjecture seeks a complete characterization of crossing matrices arising from positive pure braids, extending the known characterization for arbitrary pure braids by zero-diagonal integer symmetric matrices. Its resolution status is not specified in the supplied source context.

References

Primary source

Ayaka Shimizu and Yoshiro Yaguchi, “Characterization of the OU matrix of a braid diagram”, arXiv:2502.16035 (2025).

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.