SearcharxivSearch

arXiv · math/9412204

The normalized cyclomatic quotient associated with presentations of finitely generated groups

Abstract

Given the Cayley graph of a finitely generated group $G$, with respect to a presentation $G^α$ with $n$ generators, the quotient of the rank of the fundamental group of subgraphs of the Cayley graph by the cardinality of the set of vertices of the subgraphs gives rise to the definition of the normalized cyclomatic quotient $Ξ(G^α)$. The asymptotic behavior of this quotient is similar to the asymptotic behavior of the quotient of the cardinality of the boundary of the subgraph by the cardinality of the subgraph. Using Følner's criterion for amenability one gets that $Ξ(G^α)$ vanishes for infinite groups if and only if they are amenable. When $G$ is finite then $Ξ(G^α)=1/|G|$, where $|G|$'> is the cardinality of $G$, and when $G$ is non-amenable then $1-n\leqΞ(G^α)\le 0$, with $Ξ(G^α)=1-n$ if and only if $G$ is free of rank $n$. Thus we see that on special cases $Ξ(G^α)$ takes the values of the Euler characteristic of $G$. Most of the paper is concerned with formulae for the value of $Ξ(G^α)$ with respect to that of subgroups and factor groups, and with respect to the decomposition of the group into direct product and free product. Some of the formulae and bounds we get for $Ξ(G^α)$ are similar to those given for the spectral radius of symmetric random walks on the graph of $G^α$, but this is not always the case. In the last section of the paper we define and touch very briefly the balanced cyclomatic quotient, which is defined on concentric balls in the graph and is related to the growth of $G$.

Explore related subjects

Keep this discovery

BibTeXRIS

Amnon Rosenmann. 1994-12-28. The normalized cyclomatic quotient associated with presentations of finitely generated groups. https://arxiv.org/abs/math/9412204

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