SearcharxivSearch

arXiv · 2607.17444

Small growth rates of free groups

Abstract

We introduce the notion of a Magnus marking for a finite generating set of a group and prove a certain expansion property. Using this property, we determine the second and third smallest growth rates of the rank-$d$ free group for $d\ge 2$. We also give a new lower bound for the smallest growth rate of the genus-$g$ surface group for $g\ge 2$, as well as a lower bound for the growth rate associated with a one-relator presentation.

Explore related subjects

Keep this discovery

BibTeXRIS

Koji Fujiwara, Sang-hyun Kim, Ryokichi Tanaka. 2026-07-20. Small growth rates of free groups. https://arxiv.org/abs/2607.17444

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