Welcome to MathOverflow

Question

1

Alexander's Theorem guarantees that every oriented link is the closure of some braid. In other words, the map

$$ \displaystyle \coprod_n \mathcal B_n\longrightarrow \{\text{ oriented links }\} $$

is surjective. One algorithm (I'm actually not sure that it's Alexander's original demonstration) involves choosing a basepoint in the complement of a diagram for the link and applying Reidemeister moves until the resulting diagram winds around the point in a consistent direction, at which point the diagram is manifestly the closure of a link.

If we begin with a positive diagram for a link, then do we necessarily obtain a positive braid?

flag	asked Oct 15 2010 at 0:22 Sammy Black 1,216●4●16

I don't think any of the algorithms obviously preserve positivity. Vogel's algorithm (which I think is what you're referring to) does a lot of Reidemeister II's, which always destroys positivity. I think if there's any pair of incoherently oriented Seifert circles, Vogel's algorithm will give a non-positive result. That said, I don't know of an obvious counter-example. – Ben Webster♦ Oct 15 2010 at 3:03

Agol · Accepted Answer · 2010-10-15 05:17:54Z UTC

3

Rudolph proved that positive links are strongly quasipositive. This paper might also be relevant, which allows one to create a braid with the same number of Seifert circles and writhe. However, Yamada's algorithm doesn't seem to preserve positivity either.

answered Oct 15 2010 at 5:17

Agol
23.9k●1●33●84

Thank you. Yamada's paper is indeed interesting. – Sammy Black Oct 15 2010 at 18:55

Is a positive link the closure of a positive braid?

Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

1 Answer

You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.