Algorithmic recognition of quasipositive 4-braids of algebraic length three.

DOI10.1515/GCC-2015-0012zbMATH Open1329.20045arXiv1504.06612OpenAlexW2964234803MaRDI QIDQ889986FDOQ889986

Stepan Orevkov

Publication date: 9 November 2015

Published in: Groups - Complexity - Cryptology (Search for Journal in Brave)

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

Full work available at URL: https://arxiv.org/abs/1504.06612

Recommendations

• Algorithmic recognition of quasipositive braids of algebraic length two.
• scientific article; zbMATH DE number 2109307
• ALGORITHMS FOR POSITIVE BRAIDS
• A new algorithm for solving the word problem in braid groups
• Every braid admits a short sigma-definite expression.

zbMATH Keywords

Garside groupsbraid groupspolynomial time algorithmsArtin-Tits groupsstandard generatorsquasipositive braidsquasipositivity problem

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cited In (3)

• Automorphism group of the commutator subgroup of the braid group
• Title not available (Why is that?)
• QUASIPOSITIVITY TEST VIA UNITARY REPRESENTATIONS OF BRAID GROUPS AND ITS APPLICATIONS TO REAL ALGEBRAIC CURVES

This page was built for publication: Algorithmic recognition of quasipositive 4-braids of algebraic length three.

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