Symmetries of planar growth functions (Q1106951)

From MaRDI portal
Revision as of 02:14, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Symmetries of planar growth functions
scientific article

    Statements

    Symmetries of planar growth functions (English)
    0 references
    0 references
    0 references
    1988
    0 references
    Let G be a finitely generated group, with \(\Sigma\) a finite generating set. The growth function of G,\(\Sigma\) is the generating function, \(f(z)=f_{G,\Sigma}=\sum^{\infty}_{n=0}a_ nz\) n which has as its coefficients \(a_ n\) the number of elements of G which can be expressed as words of length n in the generators \(\Sigma\) but not by words of shorter length. The growth functions of a group exhibit in their analytic properties many of the combinatorial properties of the group. \textit{J.-P. Serre} [Cohomologie des groupes discrets, in Prospects Math., Ann. Math. Stud. 70, 77-169 (1971; Zbl 0235.22020)] showed that \(f(z)=\pm f(1/z)\) in the case that G is a compact hyperbolic or irreducible Euclidean Coxeter group with respect to the standard generating sets. It has been long conjectured that this symmetry or reciprocity condition should hold widely for geometrically defined groups. The authors show that symmetry or reciprocity holds for Euclidean and Hyperbolic planar isometry groups with respect to arbitrary geometric generating sets in almost all cases. They explicitly calculate the recursive combinatorial structure of these groups in all cases and thereby determine their growth functions.
    0 references
    finitely generated group
    0 references
    finite generating set
    0 references
    growth function
    0 references
    words
    0 references
    generators
    0 references
    irreducible Euclidean Coxeter group
    0 references
    geometrically defined groups
    0 references
    Euclidean and Hyperbolic planar isometry groups
    0 references
    geometric generating sets
    0 references

    Identifiers