Algorithmic recognition of quasipositive braids of algebraic length two.

DOI10.1016/J.JALGEBRA.2014.10.004zbMATH Open1306.20039arXiv1406.0544OpenAlexW2964237177MaRDI QIDQ479795FDOQ479795

Authors: Stepan Orevkov 

Publication date: 5 December 2014

Published in: Journal of Algebra (Search for Journal in Brave)

Abstract: We give an algorithm to decide if a given braid is a product of two factors which are conjugates of given powers of standard generators of the braid group. The same problem is solved in a certain class of Garside groups including Artin-Tits groups of spherical type. The solution is based on the Garside theory and, especially, on the theory of cyclic sliding developed by Gebhardt and Gonzalez-Meneses. We show that if a braid is of the required form, then any cycling orbit in its sliding circuit set in the dual Garside structure contains an element for which this fact is immediately seen from the left normal form.

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

Recommendations

• Algorithmic recognition of quasipositive 4-braids of algebraic length three.
• scientific article; zbMATH DE number 2109307
• Conjugacy problem for braid groups and Garside groups.
• ALGORITHMS FOR POSITIVE BRAIDS
• Garside theory and subsurfaces: some examples in braid groups

zbMATH Keywords

Garside groupsbraid groupsArtin-Tits groups of spherical typequasipositive braids

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)

Cites Work

• Braids and Signatures
• Title not available (Why is that?)
• Les immeubles des groupes de tresses généralises
• Artin-Gruppen und Coxeter-Gruppen
• Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
• The infimum, supremum, and geodesic length of a braid conjugacy class.
• A new approach to the word and conjugacy problems in the braid groups
• Algebraic functions and closed braids
• The dual braid monoid
• Artin groups of finite type are biautomatic
• THE BRAID GROUP AND OTHER GROUPS
• ALGORITHMS FOR POSITIVE BRAIDS
• QUASIPOSITIVITY TEST VIA UNITARY REPRESENTATIONS OF BRAID GROUPS AND ITS APPLICATIONS TO REAL ALGEBRAIC CURVES
• Classification of flexible \(M\)-curves of degree 8 up to isotopy
• Groupes de Garside
• On closed 3-braids
• Conjugacy in Garside groups. II: Structure of the ultra summit set.
• A new approach to the conjugacy problem in Garside groups.
• The cyclic sliding operation in Garside groups.
• Title not available (Why is that?)
• Non-crossing partitions of type \((e,e,r)\).
• Link theory and oval arrangements of real algebraic curves
• Some examples of real algebraic and real pseudoholomorphic curves
• Arrangements of an $M$-quintic with respect to a conic that maximally intersects its odd branch
• Title not available (Why is that?)
• PLANE REAL ALGEBRAIC CURVES OF ODD DEGREE WITH A DEEP NEST
• Small braids with large ultra summit set.

Cited In (7)

• The lexicographic degree of the first two-bridge knots
• Automorphism group of the commutator subgroup of the braid group
• Homomorphisms of commutator subgroups of braid groups with small number of strings
• Real algebraic and pseudoholomorphic curves on the quadratic cone and smoothings of the singularity \(X_{21}\)
• Algorithmic recognition of quasipositive 4-braids of algebraic length three.
• Title not available (Why is that?)
• On the Hurwitz action on quasipositive factorizations of 3-braids.

This page was built for publication: Algorithmic recognition of quasipositive braids of algebraic length two.

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