Efficient algorithm for recognizing the Nielsen-Thurston type of a three-strand braid.
From MaRDI portal
Publication:747093
DOI10.1007/s10958-015-2422-5zbMath1327.20041OpenAlexW566344547MaRDI QIDQ747093
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
algorithmsbraid groupsNielsen-Thurston classificationreducible braidsNielsen-Thurston types of braids
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Reducible braids and Garside theory.
- A Garside-theoretic approach to the reducibility problem in braid groups.
- Train-tracks for surface homeomorphisms
- Fast Nielsen-Thurston classification of braids.
- FAST ALGORITHMIC NIELSEN–THURSTON CLASSIFICATION OF FOUR-STRAND BRAIDS
- On the geometry and dynamics of diffeomorphisms of surfaces
- Pseudo-Anosov Maps and Invariant Train Tracks in the Disc: A Finite Algorithm
- BRAIDS AND THE NIELSEN-THURSTON CLASSIFICATION
This page was built for publication: Efficient algorithm for recognizing the Nielsen-Thurston type of a three-strand braid.
