Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2110.06761

Counting irreducible modules for profinite groups

Ged Corob Cook·Steffen Kionke·Matteo Vannacci
View original source ↗Read source document ↗Export metadata ↓

Abstract

This article is concerned with the representation growth of profinite groups over finite fields. We investigate the structure of groups with uniformly bounded exponential representation growth (UBERG). Using crown-based powers we obtain some necessary and some sufficient conditions for groups to have UBERG. As an application we prove that the class of UBERG groups is closed under split extensions but fails to be closed under extensions in general. On the other hand, we show that the closely related probabilistic finiteness property $PFP_1$ is closed under extensions. In addition, we prove that profinite groups of type $FP_1$ with UBERG are always finitely generated and we characterise UBERG in the class of pro-nilpotent groups. Using infinite products of finite groups, we construct several examples of profinite groups with unexpected properties: (1) an UBERG group which cannot be finitely generated, (2) a group of type $PFP_\infty$ which is not UBERG and not finitely generated and (3) a group of type $PFP_\infty$ with superexponential subgroup growth.

Explore related subjects

math.GRmath.RT

Keep this discovery

BibTeXRIS

Ged Corob Cook, Steffen Kionke, Matteo Vannacci. 2021-10-13. Counting irreducible modules for profinite groups. https://arxiv.org/abs/2110.06761

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗
arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗
arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗