On the complexity of braids.

DOI10.4171/JEMS/98zbMath1187.20045arXivmath/0403177MaRDI QIDQ2478601

Bert Wiest, Ivan A. Dynnikov

Publication date: 28 March 2008

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

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

zbMATH Keywords

Artin braid groupslaminationsmapping class groupscomplexitiesgenerators and relationscurve diagramsArtin generatorstrain trackslengths of braids

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Braid groups; Artin groups (20F36)

Related Items (19)

Counting intersections of normal curves ⋮ Geometric intersection of curves on punctured disks ⋮ Curve diagrams, laminations, and the geometric complexity of braids ⋮ Finite-time braiding exponents ⋮ On connectedness of chaotic sections of some 3-periodic surfaces ⋮ A simple algorithm for finding short sigma-definite representatives. ⋮ Algorithms for contractibility of compressed curves on 3-manifold boundaries ⋮ The relaxation normal form of braids is regular ⋮ Every braid admits a short sigma-definite expression. ⋮ How to read the length of a braid from its curve diagram. ⋮ Integral laminations on nonorientable surfaces ⋮ On computing the entropy of braids ⋮ Counting components of an integral lamination ⋮ Quasi-isometrically embedded subgroups of braid and diffeomorphism groups ⋮ Simplifying triangulations ⋮ Interval identification systems and plane sections of 3-periodic surfaces ⋮ Tracing compressed curves in triangulated surfaces ⋮ On the minimal positive standardizer of a parabolic subgroup of an Artin-Tits group ⋮ Circuit complexity of knot states in Chern-Simons theory

This page was built for publication: On the complexity of braids.