Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1112.1771

Automatic structures and growth functions for finitely generated abelian groups

Satoshi Kamei
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we consider the formal power series whose n-th coefficient is the number of copies of a given finite graph in the ball of radius n centred at the identity element in the Cayley graph of a finitely generated group and call it the growth function. Epstein, Iano-Fletcher and Uri Zwick proved that the growth function is a rational function if the group has a geodesic automatic structure. We compute the growth function in the case where the group is abelian and see that the denominator of the rational function is determined from the rank of the group.

Explore related subjects

math.GRmath.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Satoshi Kamei. 2011-12-12. Automatic structures and growth functions for finitely generated abelian groups. https://arxiv.org/abs/1112.1771

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↗