Any knot or link can be written in braid notation (with implied closure of strands). Some natural questions:


1. Assume I don't allow inverses - only overcrossings are used as generators. Anything known about the braid index then (might as well be $\infty$, i.e., this representation doesn't always exist)?
2. Assume I additionally allow Temperley-Lieb generators (what's that called, Turaev algebra?). Same question.
3. For all three variants - surely the braid representation has some overhead with respect to the minimum crossing representation of a knot. How large can it get?



"Effectivity" of braid notation for knots
(1) It is a theorem of Stallings [1978, "Constructions of fibred knots and links"] that closures of positive braids are always fibered links. Thus "most" knots are not realised as the closure of a positive braid.


(2) If you allow positive (say) crossings only, and TL generators, then you can use the latter to rotate the former by 90 degrees. Then the given diagram can be converted with at most a linear growth in complexity.


(3) Interesting question. I'll guess that the blow up is at worst polynomial.


