An Implementation of the Bestvina–Handel Algorithm for Surface Homeomorphisms
From MaRDI portal
Uniformly hyperbolic systems (expanding, Anosov, Axiom A, etc.) (37D20) Dynamical systems involving homeomorphisms and diffeomorphisms of planes and surfaces (37E30) Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04) Group actions on manifolds and cell complexes in low dimensions (57M60)
Abstract: Bestvina and Handel have found an effective algorithm that determines whether a given homeomorphism of an orientable, possibly punctured surface is pseudo-Anosov. We present a software package in Java that realizes this algorithm for surfaces with one puncture. Moreover, the package allows the user to define homeomorphisms in terms of Dehn twists, and in the pseudo-Anosov case it generates images of train tracks in the sense of Bestvina-Handel.
Recommendations
- Computing Triangulations of Mapping Tori of Surface Homeomorphisms
- Approximating homotopy equivalences of surfaces by homeomorphisms
- Algorithms to compute the topology of orientable real algebraic surfaces
- Dynamics of shear homeomorphisms of tori and the Bestvina-Handel algorithm
- scientific article; zbMATH DE number 1857881
- scientific article; zbMATH DE number 1342334
- Computing Nielsen numbers of surface homeomorphisms
- An algorithm for acylindrical surfaces in 3-manifolds
- Algorithmic homeomorphism of 3-manifolds as a corollary of geometrization
- Algorithmical determination of the topology of a real algebraic surface
Cites work
Cited in
(14)- Computing the Teichmüller polynomial
- Some developments in Nielsen fixed point theory
- Topological chaos in spatially periodic mixers
- Polynomial invariants for fibered 3-manifolds and Teichmüller geodesics for foliations
- Book review of: A. Fathi et al., Thurston's work on surfaces
- Polynomial invariants of pseudo-Anosov maps
- Computing Triangulations of Mapping Tori of Surface Homeomorphisms
- DECOMPOSITIONS OF PLANAR HOMEOMORPHISMS USING COMPUTER SOFTWARE
- On the structure of the centralizer of a braid
- Pseudo-Anosov Maps and Invariant Train Tracks in the Disc: A Finite Algorithm
- Quadratic Bounds on the Quasiconvexity of Nested Train Track Sequences
- Algorithmic detectability of iwip automorphisms.
- Standardly embedded train tracks and pseudo-Anosov maps with minimum expansion factor
- Quadratic-time computations for pseudo-Anosov mapping classes
This page was built for publication: An Implementation of the Bestvina–Handel Algorithm for Surface Homeomorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743872)