One of the fundamental facts underlying the application of braid theory to knot theory is that braids inject into string links.
This means that braids B1 and B2, considered inside a cube I3, are related by ambient isotopy if and only if they are related by height-preserving ambient isotopy. This is a non-trivial fact whose proofs are all somewhat complicated (Stallings Theorem/ Magnus expansion/ embedding fibrations).
Given that there is no theoretical advantage to injecting braids into string links (distinct braids stay distinct), I wonder whether there is a computational advantage in doing so. Explicitly, given diagrams for B1 and for B2, is the minimum number of Reidemeister moves between them always realized for Reidemeister moves between braids? Or might the `shortest path between two braids' pass through string links?
Question: Is there an example of a pair of equivalent braid diagrams, considered as tangle diagrams, such that the minimum number of Reidemeister moves between them is increased if we allow only braid-like Reidemeister moves (i.e. if the result of each Reidemeister move must also be a braid)?
This post imported from StackExchange MathOverflow at 2014-10-25 10:37 (UTC), posted by SE-user Daniel Moskovich