Skip to main content
10 events
when toggle format what by license comment
Feb 27, 2021 at 20:14 comment added Zen It seems the solution to my problem can be found in a 1991 paper: SPLIT BRAIDS STEPHEN P. HUMPHRIES. I wonder whether that is implemented in the programs such as flipper, or perhaps the more general case of determining the word of the constituent braid formed by the tubes.
Feb 27, 2021 at 1:40 comment added Zen I am afraid I either closed this question too early -- or I get the definition of reduced braids wrong. Since I believe that if braids would run in tubes that form the braid a_1 a_2^-1 a_1 a_2^-1 a_1 a_2^-1 this would be a reduced braid. But I could not move the tubes apart while moving the top and bottom of the strands synchronously. Or I possibly didn't correctly understand the other questions.
Feb 27, 2021 at 1:16 history edited Zen CC BY-SA 4.0
added 124 characters in body
Feb 27, 2021 at 1:05 history edited Zen CC BY-SA 4.0
added 29 characters in body
Feb 27, 2021 at 0:59 history edited Zen CC BY-SA 4.0
added 670 characters in body
Feb 26, 2021 at 21:52 history edited Zen CC BY-SA 4.0
added 90 characters in body
Feb 26, 2021 at 21:32 history closed CommunityBot Duplicate of Algorithm for identifying reducible braids
Feb 26, 2021 at 19:49 comment added Ian Agol I think you're asking for whether the associated mapping class is reducible. If so, then this is a repeat of this question: mathoverflow.net/q/343156/1345 So I suggest in that case that this question be closed as a repeat.
Feb 26, 2021 at 18:21 review First posts
Feb 26, 2021 at 19:11
Feb 26, 2021 at 18:17 history asked Zen CC BY-SA 4.0