Centralizers in the R. Thompson group \(V_n\). (Q2637225)

From MaRDI portal
Revision as of 11:15, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Centralizers in the R. Thompson group \(V_n\).
scientific article

    Statements

    Centralizers in the R. Thompson group \(V_n\). (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 February 2014
    0 references
    The Higman-Thompson groups \(V_n\), with \(n\geq 2\), are generalizations of Thompson's group \(V\). The group \(V_n\) can be defined as a subgroup of the group of homeomorphisms of the boundary of a rooted tree \(T_n\) of degree \(n\). If we fix an ordering on the children of every node in \(T_n\), an element of \(V_n\) can be described by a pair of rooted finite \(n\)-ary subtrees \(A,B\subset T_n\) together with a bijection \(\varphi\) of their sets of leaves. Such a bijection induces a unique order-preserving isomorphism between the complements of \(A\) and \(B\), which in turn yields a homeomorphism of \(\partial T_n\). The main result of the paper is a detailed description of the centralizer of an arbitrary element of \(V_n\) as a finite direct product of semidirect products \(K_i\rtimes G_i\) and wreath products of the form \((A_j\rtimes\mathbb Z)\wr P_j\), where \(K_i\), \(G_i\), and \(P_j\) are given explicitly, and \(A_j\) are certain finite groups. The authors leave open two questions about this decomposition, which amount to asking whether the groups \(A_j\rtimes\mathbb Z\) are Abelian. For calculations in \(V_n\) the authors use revealing pairs of \textit{M. G. Brin} [Geom. Dedicata 108, 163-192 (2004; Zbl 1136.20025)]. They are pairs of trees representing an element of \(V_n\) in a way that allows to read its dynamics. As an important tool in their analysis, they introduce the notions of a discrete train track and flow graph, which model the dynamics of a homeomorphism of a totally disconnected space, allowing a level of intuitive understanding of the action of \(V_n\) on \(\partial T_n\). It follows from the authors' description that centralizers in \(V_n\) are finitely generated. Moreover, using the ideas developed in the paper, they give a simple proof that elements of infinite order in \(V_n\) are undistorted.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Higman-Thompson groups
    0 references
    conjugacy
    0 references
    centralizers
    0 references
    Thompson group \(V\)
    0 references
    rooted trees
    0 references
    train tracks
    0 references
    flow graphs
    0 references
    homeomorphism groups
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references