Formal conjugacy growth in graph products I
Group Theory
2021-03-09 v1 Combinatorics
Abstract
In this paper we give a recursive formula for the conjugacy growth series of a graph product in terms of the conjugacy growth and standard growth series of subgraph products. We also show that the conjugacy and standard growth rates in a graph product are equal provided that this property holds for each vertex group. All results are obtained for the standard generating set consisting of the union of generating sets of the vertex groups.
Keywords
Cite
@article{arxiv.2103.04696,
title = {Formal conjugacy growth in graph products I},
author = {Laura Ciobanu and Susan Hermiller and Valentin Mercier},
journal= {arXiv preprint arXiv:2103.04696},
year = {2021}
}
Comments
33 pages