Search arXivSearch

arXiv · 1809.08584

Nombre de classes de conjugaison d'\'el\'ements d'ordre fini dans les groupes de Brown-Thompson

Abstract

We extend a result of Matucci on the number of conjugacy classes of finite order elements in the Thompson group $T$. According to Liousse, if $ gcd(m-1,q)$ is not a divisor of $r$ then there does not exist element of order $q$ in the Brown-Thompson group $T_{r,m}$. We show that if $ gcd(m-1,q)$ is a divisor of $r$ then there are exactly $\varphi(q). gcd(m-1,q)$ conjugacy classes of elements of order $q$ in $T_{r,m}$, where $\varphi$ is the Euler function phi. As a corollary, we obtain that the Thompson group $T$ is isomorphic to none of the groups $T_{r,m}$, for $m\not=2$ and any morphism from $T$ into $T_{r,m}$, with $m\not=2$ and $r\not= 0$ $mod \ (m-1)$, is trivial.

Explore related subjects

Keep this discovery

BibTeXRIS

Hajer Hmili, Isabelle Liousse. 2018-09-23. Nombre de classes de conjugaison d'\'el\'ements d'ordre fini dans les groupes de Brown-Thompson. https://arxiv.org/abs/1809.08584

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR