SearcharxivSearch

arXiv · 1407.6701

Uniform growth rate

Abstract

In an evolutionary system in which the rules of mutation are local in nature, the number of possible outcomes after $m$ mutations is an exponential function of $m$ but with a rate that depends only on the set of rules and not the size of the original object. We apply this principle to find a uniform upper bound for the growth rate of certain groups including the mapping class group. We also find a uniform upper bound for the growth rate of the number of homotopy classes of triangulations of an oriented surface that can be obtained from a given triangulation using $m$ diagonal flips.

Explore related subjects

Keep this discovery

BibTeXRIS

Kasra Rafi, Jing Tao. 2016-05-12. Uniform growth rate. https://arxiv.org/abs/1407.6701

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