Growth of positive words and lower bounds of the growth rate for Thompson's groups $F(p)$

Jose Burillo; Victor Guba

Home/Archive/arXiv

arXiv · math/0511474

Growth of positive words and lower bounds of the growth rate for Thompson's groups $F(p)$

Jose Burillo·Victor Guba

View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $F(p)$, $p\ge2$ be the family of generalized Thompson's groups. Here F(2) is the famous Richard Thompson's group usually denoted by $F$. We find the growth rate of the monoid of positive words in $F(p)$ and show that it does not exceed $p+1/2$. Also we describe new normal forms for elements of $F(p)$ and, using these forms, we find a lower bound for the growth rate of $F(p)$ in its natural generators. This lower bound asymptotically equals $(p-1/2)\log_2 e+1/2$ for large values of $p$.

Explore related subjects

math.GR

Keep this discovery

BibTeX RIS

Jose Burillo, Victor Guba. 2005-11-18. Growth of positive words and lower bounds of the growth rate for Thompson's groups $F(p)$. https://arxiv.org/abs/math/0511474

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

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗