Counting finite index subgroups and the P. Hall enumeration principle (Q582393): Difference between revisions

Let G be a finitely generated group and let n be a natural number. Let \(a_ n(G)\) denote the (necessarily finite) number of subgroups of G having index n and define the zeta function of G as \(f_ G(s)=\sum a_ n(G)n^{-s}\). Thus the zeta function of the additive group of integers is just the classical Riemann zeta function. The author uses the enumeration principle of \textit{Ph. Hall} [Proc. Lond. Math. Soc., II. Ser. 36, 29-95 (1933; Zbl 0007.29102)] to attack various questions concerning this zeta function. He gives a recursive formula for \(a_ n(Fp)\) where Fp denotes free pro-p-group on finitely many generators. He also gives an alternative approach to the calculation of the zeta function of a free Abelian group - a calculation first done by \textit{C. Bushnell} and \textit{I. Reiner} [Bull. Am. Math. Soc., New Ser. 2, 306-310 (1980; Zbl 0444.12010)] and by \textit{F. Grunewald}, \textit{D. Segal} and \textit{G. Smith} [Invent. Math. 93, 185-223 (1988; Zbl 0651.20040)]. Finally, he uses these techniques to give an infinite family of pairwise non-isomorphic groups with the same zeta function.