The root extraction problem for generic braids

arXiv1909.10962MaRDI QIDQ6325895FDOQ6325895

Authors: María Cumplido, Juan González-Meneses, Marithania Silvero 

Publication date: 24 September 2019

Abstract: We show that, generically, finding the $k$-th root of a braid is very fast. More precisely, we provide an algorithm which, given a braid $x$ on $n$ strands and canonical length $l$, and an integer $k>1$, computes a $k$-th root of $x$, if it exists, or guarantees that such a root does not exist. The generic-case complexity of this algorithm is $O(l(l+n)n^{3}logn)$. The non-generic cases are treated using a previously known algorithm by Sang-Jin Lee.

This page was built for publication: The root extraction problem for generic braids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325895)