SearcharxivSearch

arXiv · 1701.04374

Rational growth and degree of commutativity of graph products

Abstract

Let $G$ be an infinite group and let $X$ be a finite generating set for $G$ such that the growth series of $G$ with respect to $X$ is a rational function; in this case $G$ is said to have rational growth with respect to $X$. In this paper a result on sizes of spheres (or balls) in the Cayley graph $\Gamma(G,X)$ is obtained: namely, the size of the sphere of radius $n$ is bounded above and below by positive constant multiples of $n^\alpha \lambda^n$ for some integer $\alpha \geq 0$ and some $\lambda \geq 1$. As an application of this result, a calculation of degree of commutativity (d. c.) is provided: for a finite group $F$, its d. c. is defined as the probability that two randomly chosen elements in $F$ commute, and Antol\'in, Martino and Ventura have recently generalised this concept to all finitely generated groups. It has been conjectured that the d. c. of a group $G$ of exponential growth is zero. This paper verifies the conjecture (for certain generating sets) when $G$ is a right-angled Artin group or, more generally, a graph product of groups of rational growth in which centralisers of non-trivial elements are "uniformly small".

Explore related subjects

Keep this discovery

BibTeXRIS

Motiejus Valiunas. 2017-01-16. Rational growth and degree of commutativity of graph products. https://doi.org/10.1016/j.jalgebra.2019.01.001

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