Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Algorithmic recognition of quasipositive 4-braids of algebraic length three

Algorithmic recognition of quasipositive 4-braids of algebraic length three 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). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Algorithmic recognition of quasipositive 4-braids of algebraic length three

Groups Complexity Cryptology , Volume 7 (2) – Nov 1, 2015

Loading next page...
 
/lp/de-gruyter/algorithmic-recognition-of-quasipositive-4-braids-of-algebraic-length-0pWsJOkzxv
Publisher
de Gruyter
Copyright
Copyright © 2015 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2015-0012
Publisher site
See Article on Publisher Site

Abstract

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).

Journal

Groups Complexity Cryptologyde Gruyter

Published: Nov 1, 2015

There are no references for this article.