SearcharxivSearch

arXiv · math/0504574

Fixed conjugacy classes of normal subgroups and the k(GV)-problem

Abstract

We establish several new bounds for the number of conjugacy classes of a finite group, all of which involve the maximal number c of conjugacy classes of a normal subgroup fixed by some element of a suitable subset of the group. To apply these formulas effectively, the parameter c, which in general is hard to control, is studied in some important situations. These results are then used to provide a new, shorter proof of the most difficult case of the well-known k(GV)-problem, which occurs for p=5 and V induced from the natural module of a 5-complement of GL(2,5). We also show how, for large p, the new results reduce the k(GV)-problem to the primitive case, thereby improving previous work on this. Furthermore, we discuss how they can be used in tackling the imprimitive case of the as of yet unsolved noncoprime k(GV)-problem.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Michael Keller. 2005-04-28. Fixed conjugacy classes of normal subgroups and the k(GV)-problem. https://arxiv.org/abs/math/0504574

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

KEEP EXPLORING

Related papers

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

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

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