Counting characters in linear group actions.
Let \(G\) be a finite group and \(V\) a finite \(G\)-module in characteristic \(p\). \textit{R. Knörr}, [in Ill. J. Math. 28, 181-210 (1984; Zbl 0536.20007)], established strong upper bounds on the number \(k(GV)\) of conjugacy classes of the semidirect product \(GV\) by using only information on \(C_G(v)\) for some \(v\in V\) in the coprime case, that is, \((|G|,|V|)=1\). In particular, Knörr's result implies \(k(GV)\leq |V|\) when \(G\) has a regular orbit on \(V\), and this latter bound played a crucial role in the subsequent solution of the \(k(GV)\)-problem by the efforts of many authors [cf. \textit{P. Schmid}, The solution of the \(k(GV)\) problem. ICP Advanced Texts in Mathematics 4. London: Imperial College Press (2007; Zbl 1153.20001)]. In this paper, the author generalizes Knörr argument to obtain various upper bounds for the cardinalities of certain subsets of irreducible characters of \(GV\) including the non-coprime case.
- A bound on norms of generalized characters with applications
- Fixed conjugacy classes of normal subgroups and the k(GV)-problem.
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- On the number of characters in a p-block of a p-solvable group
- Some remarks on the k(GV ) theorem
- The solution of the k(GV) problem.
- The solution of the \(k(GV)\)-problem.
This page was built for publication: Counting characters in linear group actions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836122)