Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
Algorithmic recognition of quasipositive 4-braids of algebraic length three
-
Stepan Yu. Orevkov
Veröffentlicht/Copyright:
8. Oktober 2015
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).
MSC: 20F36
Received: 2015-5-2
Published Online: 2015-10-8
Published in Print: 2015-11-1
© 2015 by De Gruyter
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Frontmatter
- A combinatorial algorithm to compute presentations of mapping class groups of orientable surfaces with one boundary component
- Non-abelian analogs of lattice rounding
- Tree-based language complexity of Thompson's group F
- New probabilistic public-key encryption based on the RSA cryptosystem
- Algorithmic recognition of quasipositive 4-braids of algebraic length three
- Cryptanalysis of a system using matrices over group rings
- On transitive differentiable modulo pn functions
- On the generic complexity of the searching graph isomorphism problem
- Key agreement under tropical parallels
Artikel in diesem Heft
- Frontmatter
- A combinatorial algorithm to compute presentations of mapping class groups of orientable surfaces with one boundary component
- Non-abelian analogs of lattice rounding
- Tree-based language complexity of Thompson's group F
- New probabilistic public-key encryption based on the RSA cryptosystem
- Algorithmic recognition of quasipositive 4-braids of algebraic length three
- Cryptanalysis of a system using matrices over group rings
- On transitive differentiable modulo pn functions
- On the generic complexity of the searching graph isomorphism problem
- Key agreement under tropical parallels
