The Root Extraction Problem for Generic Braids
We show that, generically, finding the <i>k</i>-th root of a braid is very fast. More precisely, we provide an algorithm which, given a braid <i>x</i> on <i>n</i> strands and canonical length <i>l</i>, and an integer <inline-formula> <math dis...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-10-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/11/11/1327 |