Counting characters in linear group actions.
From MaRDI portal
Abstract: Let be a finite group and be a finite --module. We present upper bounds for the cardinalities of certain subsets of , such as the set of those such that, for a fixed , the restriction of to is not a multiple of the regular character of . These results might be useful in attacking the non--coprime --problem.
Recommendations
Cites work
- scientific article; zbMATH DE number 3526920 (Why is no real title available?)
- A bound on norms of generalized characters with applications
- Fixed conjugacy classes of normal subgroups and the k(GV)-problem.
- 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.
Cited in
(3)
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)