Arborescence of positive Thompson links (Q2123060)

The Thompson group \(F\) contains a natural positive monoid \(F_+\) generated by countably many generators \(x_0, x_1, x_2, \dots\) and it comes with a link construction described by \textit{V. F. R. Jones} [J. Comb. Algebra 1, No. 1, 1--44 (2017; Zbl 1472.57014); Springer Proc. Math. Stat. 284, 43--66 (2019; Zbl 1423.57013)]. The elements of the Thompson group can be encoded by pairs of finite rooted binary plane trees and each element is a product of a positive and a negative element. In the paper under review the authors refer to links associated with positive elements as positive Thompson links. \textit{G. Golan} and \textit{M. Sapir} [J. Algebra 470, 122--159 (2017; Zbl 1375.20043)] asked what types of links correspond to \(F_+\). In the paper it is shown that these links are all arborescent. In the main theorem it is proved that the set of positive Thompson links coincides with the set of closures of bipartite arborescent tangles. As a second result the authors have that the set of positive Thompson links contains the set of arborescent links associated with weighted plane rooted trees with all strictly positive weights.