The normalized cyclomatic quotient associated with presentations of finitely generated groups
Amnon Rosenmann
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≤Ξ(Gα) 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.
Create a lesson
Related papers
Kleisli convolution representations of power monoids
Haicun Wen, Jian He, Yu-Zhe Liu
The Hurwitz Action in the Affine Symmetric Group
Patrick Wegener
Classification of Group Extensions
Claude Archer
A Determination of B-groups of Order p4
Christopher Herbig
A note on normal generation and the first 2-betti number
Sam P. Fisher, Yash Lodha
Asymptotic enumeration of minimally transitive permutation groups
Binzhou Xia, Shasha Zheng