Efficient algorithm for recognizing the Nielsen-Thurston type of a three-strand braid.

DOI10.1007/S10958-015-2422-5zbMATH Open1327.20041OpenAlexW566344547MaRDI QIDQ747093FDOQ747093

Authors: O. N. Biryukov 

Publication date: 23 October 2015

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-015-2422-5

zbMATH Keywords

algorithmsbraid groupsNielsen-Thurston classificationreducible braidsNielsen-Thurston types of braids

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Braid groups; Artin groups (20F36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• On the geometry and dynamics of diffeomorphisms of surfaces
• Braids: a survey
• Title not available (Why is that?)
• Train-tracks for surface homeomorphisms
• A Garside-theoretic approach to the reducibility problem in braid groups.
• Fast algorithmic Nielsen-Thurston classification of four-strand braids.
• Reducible braids and Garside theory.
• BRAIDS AND THE NIELSEN-THURSTON CLASSIFICATION
• Fast Nielsen-Thurston classification of braids.
• Pseudo-Anosov Maps and Invariant Train Tracks in the Disc: A Finite Algorithm

Cited In (3)

• Dual Garside structure and reducibility of braids.
• Syntactical methods for braids of three strands
• Fast Nielsen-Thurston classification of braids.

This page was built for publication: Efficient algorithm for recognizing the Nielsen-Thurston type of a three-strand braid.

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