Algorithmic recognition of quasipositive 4-braids of algebraic length three
Group Theory
2024-12-04 v2
Abstract
We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We give also a polynomial algorithm to decide if a given braid with any number of strings is a product of two factors which are conjugates of given powers of the standard generators (in my previous paper this problem was solved without polynomial estimates).
Keywords
Cite
@article{arxiv.1504.06612,
title = {Algorithmic recognition of quasipositive 4-braids of algebraic length three},
author = {Stepan Yu. Orevkov},
journal= {arXiv preprint arXiv:1504.06612},
year = {2024}
}
Comments
19 pages, 1 figure