On the topological entropy of families of braids (Q1014534)

From MaRDI portal
Revision as of 12:55, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the topological entropy of families of braids
scientific article

    Statements

    On the topological entropy of families of braids (English)
    0 references
    0 references
    0 references
    29 April 2009
    0 references
    In the dynamical study of iterated surface homeomorphisms, it is common to seek to compute the topological entropy of each member of an infinite family of isotopy classes -- the topological entropy of an isotopy class being the minimum topological entropy of a homeomorphism in the class. The normal approach to such a problem is to use train-track methods. One drawback of this approach is that even single train tracks are fairly unwieldy objects. It is usually far from straightforward to describe an infinite family of train tracks, to verify that they are indeed invariant under the relevant isotopy classes, and to compute the transition matrices and hence the topological entropy of the induced train track maps. In the paper, an alternative approach to the problem is described in the case of families of isotopy classes of orientation preserving homeomorphisms of punctured disks -- such isotopy classes are described by elements of Artin's braid groups. A method for computing the topological entropy of each braid in an infinite family makes use of Dynnikov coordinates on the boundary of the Teichmüller space. The method is illustrated by applying it to two families of braids considered by [\textit{E.~Hironaka} and \textit{E.~Kin}, Algebr. Geom. Topol. 6, 699--738 (2006; Zbl 1126.37014)].
    0 references
    0 references
    topological entropy
    0 references
    Nielson-Thurston classification
    0 references
    Dynnikov coordinates
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references