scientific article; zbMATH DE number 4010769

From MaRDI portal
Publication:3760732





[For the entire collection see Zbl 0611.00010.] For what infinite groups is it possible to understand the combinatorial asymptotic structure explicitly? The author addresses this question for virtually nilpotent groups. Suppose G is a group generated as a monoid by a finite subset S. The growth series of G,S, is defined by \(P(t)=\sum_{g}t^{| g|}\), where g ranges over the elements of G and \(| g|\) denotes the minimum length of g as a word in the generators S. The author outlines a simplified proof that P(t) is rational whenever G is a virtual class 1 nilpotent group. He also computes P(t) for a special case where G is a class 2 nilpotent group.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3760732)