Algorithmic recognition of quasipositive 4-braids of algebraic length three.
DOI10.1515/GCC-2015-0012zbMATH Open1329.20045arXiv1504.06612OpenAlexW2964234803MaRDI QIDQ889986FDOQ889986
Authors: Stepan Orevkov
Publication date: 9 November 2015
Published in: Groups - Complexity - Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.06612
Recommendations
Garside groupsbraid groupspolynomial time algorithmsArtin-Tits groupsstandard generatorsquasipositive braidsquasipositivity problem
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 (8)
- Fast algorithmic Nielsen-Thurston classification of four-strand braids.
- Polynomial braid combing
- Automorphism group of the commutator subgroup of the braid group
- Title not available (Why is that?)
- Criterion of Hurwitz equivalence for quasipositive factorizations of 3-braids.
- Recognizing trace graphs of closed braids
- QUASIPOSITIVITY TEST VIA UNITARY REPRESENTATIONS OF BRAID GROUPS AND ITS APPLICATIONS TO REAL ALGEBRAIC CURVES
- Algorithmic recognition of quasipositive braids of algebraic length two.
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)