BOUNDED GENERATION AND SUBGROUP GROWTH

From MaRDI portal





One says that a profinite group has bounded generation if it is a product of finitely many procyclic groups. A profinite group \(G\) is said to have polynomial subgroup growth if the number of subgroups of index at most \(n\) in \(G\) is bounded by some fixed power of \(n\). It is well-known that a pro-\(p\) group has polynomial subgroup growth if and only if it has bounded generation. The author proves as the main result of the paper that a profinite group of polynomial subgroup growth has bounded generation. The converse is not true for profinite groups, but the author proves that a profinite group of bounded generation has subgroup growth at most \(n^{c\log n}\). The topic is related to the congruence subgroup problem, since, as was shown by \textit{V. P. Platonov} and \textit{A. S. Rapinchuk} [Russ. Acad. Sci., Izv., Math. 40, No. 3, 455-476 (1993); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 56, No. 3, 483-508 (1992; Zbl 0785.20025)] and by \textit{A. Lubotzky} [Invent. Math. 119, No. 2, 267-295 (1995; Zbl 0848.20036)] (semi-independently), an \(S\)-arithmetic subgroup \(G\) of a semisimple algebraic group (in characteristic zero) has the congruence subgroup property if and only if the profinite completion of \(G\) has bounded generation. This makes the question of the equivalence of bounded generation and polynomial subgroup growth for \(S\)-arithmetic groups particularly interesting. The author promises to give some evidences of such an equivalence in his future work.











This page was built for publication: BOUNDED GENERATION AND SUBGROUP GROWTH

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