Counting characters in linear group actions
Thomas Michael Keller

TL;DR
This paper establishes upper bounds on the sizes of specific subsets of irreducible characters in finite group modules, which could aid in addressing the non-coprime $k(GV)$-problem in representation theory.
Contribution
It provides new upper bounds for subsets of irreducible characters in finite group modules, advancing understanding in the representation theory of finite groups.
Findings
Derived upper bounds for subsets of irreducible characters
Potential applications to the non-coprime $k(GV)$-problem
Enhanced tools for analyzing group actions on modules
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · graph theory and CDMA systems
**Counting characters in linear group actions
**
by
Thomas Michael Keller
Department of Mathematics
Texas State University
601 University Drive
San Marcos, TX 78666
USA
e–mail: [email protected]
2000 Mathematics Subject Classification: 20C15.
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.
1 Introduction
Let be a finite group and be a finite –module of characteristic . If , then in [3, Theorem 2.2] R. Knörr presented a beautiful argument showing how to obtain strong upper bounds for (the number of conjugacy classes of ) by using only information on for a fixed . Note that his result immediately implies the important special case that if has a regular orbit on (i.e., there is a with ), then , which was a crucial result in the solution of the –problem. In this note we give a much shorter proof of this result (see 3 below).
The main objective of the paper, however, is to modify and generalize Knörr’s argument in various directions to include non–coprime situations. This way we obtain a number of bounds on certain subsets of , such as the following:
**Theorem A. **Let be a finite group and let be a finite –module of characteristic . Let and and suppose that . Then the number of irreducible characters whose restriction to is not a multiple of the regular character of is bounded above by
[TABLE]
*where the are representatives of the conjugacy classes of .
**Theorem B. **Let be a finite group and be a finite –module. Let be of prime order not dividing . Then the number of irreducible characters of whose restriction to is not a multiple of the regular character of is bounded above by
[TABLE]
*where denotes the number of orbits of on .
Stronger versions and refinements of these results are proved in the paper. It is hoped that these results prove useful in solving the non–coprime –problem, as discussed, for instance, in [2] and [1]. Theorem A and B will be proved in Sections 3 and 4 below respectively. In Section 2, we will generalize a recent result of P. Schmid [5, Theorem 2(a)] stating that in the situation of the –problem, if has a regular orbit on , then can only hold if is abelian. We prove
**Theorem C. **Let be a finite group and a finite faithful –module with . Suppose that has a regular orbit on . Then
[TABLE]
Our proof is different from the approach taken in [5], and we actually will prove a slightly stronger result including some non–coprime actions.
Notation: If the group acts on the set , we write for the number of orbits of on . All other notation is standard or explained along the way.
2 and regular orbits
In this paper we often work under the hypothesis of the –problem which is the following.
2.1 **Hypothesis. ** Let be a finite group and let be a finite faithful –module such that . Write for the characteristic of .
In [5, Theorem 2(a)] P. Schmid proved that under 2, if has a regular orbit on , is irreducible, and , then is abelian, and from this it follows easily that either and , or is cyclic of order . The proof in [5] is somewhat technical.
The goal of this section is to give a short proof of a generalization of Schmid’s result based on a beautiful argument of Knörr [3]. We word it in such a way that we even do not need the coprime hypothesis, so that the result may even be useful to study the non–coprime –problem. To do this, for any group and we introduce the set
[TABLE]
and write
[TABLE]
2.2 *Theorem. *** Let be a finite group and let be a finite –module such that possesses a regular orbit on . Let be a representative of such an orbit. Then
[TABLE]
Proof. Let be the characteristic if . We proceed exactly as in Case (ii) of the proof of [3, Theorem 2.2]. Write . As , we see that for we trivially have that and are coprime, and so that proof yields
[TABLE]
where is the character of defined by with being the regular character of . Now for any we have
[TABLE]
where the last step follows from [4, Corollary 4]. Next observe that if with , then and clearly is not a multiple of , and then clearly
[TABLE]
Thus with (1), (2), and (3) we get
[TABLE]
which yields
[TABLE]
This implies the assertion of the theorem, and we are done.
The following consequence implies Schmid’s result [5, Theorem 2(a)].
2.3 *Corollary. *** Assume 2 and that has a regular orbit on . Then
[TABLE]
*In particular, if , then is abelian.
Proof. By Ito’s theorem and as , we know that divides for every , so in particular does not divide . Thus for any we see that cannot be an integer multiple of . Therefore . Now the assertion follows from 2.
3 Bounds for
In this section we study more variations of Knörr’s argument in [3, Theorem 2.2] and generalize it to some non-coprime situations.
We begin, however, by looking at a classical application of it. An important and immediate consequence of Knörr’s result is that if under 2 has a regular orbit on , then . This important result can be obtained in the following shorter way.
3.1 **Proposition. ** Let be a finite group and let be a finite faithful –module. Let . Then
[TABLE]
in particular, if and has a regular orbit on , then .
Proof. Put . If , then by [4, Corollary 4] we know that . With this and well–known character theory we get
[TABLE]
This implies the first result. If , then by Ito’s result \tau(1)\big{|}|G| for all , so cannot divide , and thus , and the second result now follows by choosing to be in a regular orbit of on .
Now we turn to generalizing Knörr’s argument. We discuss various ways to do so.
3.2 **Remark. ** Let be a finite group and let be a finite faithful –module of characteristic . Let and put and . Let
[TABLE]
and
[TABLE]
so that clearly .
Note that if , then by Ito .
To work towards our next result, we again proceed somewhat similarly as in [3, Theorem 2.2]. In the following we work under the hypothesis that . Let . Then divides . Moreover, from Knörr’s proof we know that if () with are representatives of the conjugacy classes of and () are representatives of the –conjugacy classes of then, the are representatives of those conjugacy classes of which intersect nontrivially.
Moreover recall from Knörr’s proof that for , , , we know that
[TABLE]
Now define a character on by .
Then for , we have
[TABLE]
Therefore vanishes on all conjugacy classes of which intersect trivially, whereas for , we have that
[TABLE]
Thus if () are representatives of the conjugacy classes of , then we get
[TABLE]
and thus
[TABLE]
Now if , as in [3] write
[TABLE]
where is a character of or .
Then as in [3] we see that
[TABLE]
where ”” is some arbitrary ordering on .
Now if is a nonzero multiple of , then
[TABLE]
and thus
[TABLE]
Moreover, note that if , then not all can be equal to 0 as otherwise from (2) we see that would be equal to for any . So we can partition the set into two disjoint nonempty subsets and , and thus as in [3] we see that , so there are at least pairs such that . Thus
[TABLE]
Therefore by (1) and (5) we get that
[TABLE]
and thus
[TABLE]
From now on we assume that .
Now we repeat the arguments of this proof, but replace by
[TABLE]
so for and we have
[TABLE]
Now from the above we know that the (, ) are representatives of those conjugacy classes which intersect nontrivially.
Clearly vanishes on all conjugacy classes of which intersect trivially, whereas for , , if , we have that
[TABLE]
Next we conclude that
[TABLE]
and so as in (1) we see that
[TABLE]
Now with (2) similarly as in [3] we see that
[TABLE]
for some arbitrary ordering on .
Now recall that if , then not all of the can be 0. So choose such that . If all the () are integer multiples of then put and , so and and from we clearly deduce that , so there are at least pairs such that is a nonzero multiple of .
So next we assume that is not a multiple of .
Then put
[TABLE]
and
[TABLE]
Clearly , so . If , then , and if we define , as in the previous argument, we see that there are at least pairs such that is a nonzero multiple of .
So now suppose . Then , and if and , then clearly is not a multiple of , and by the same argument as used before we see that , so there are at least pairs such that is not a multiple of .
Altogether we thus have shown that for any one of the following holds:
(A) There are at least pairs such that
[TABLE]
(B) there are at least pairs such that
[TABLE]
Now it remains to consider two cases:
Case 1: At least half of the satisfy (A).
Then for any of these by (3) and (4) we have
[TABLE]
and so by (1) we see that
[TABLE]
which implies
[TABLE]
Case 2: At least half of the satisfy (B).
Then for any of these by (8) and [4, Corollary 4] we have
[TABLE]
Thus by (7) we have that
[TABLE]
whence
[TABLE]
Now we drop the assumption and work towards a general bound for .
For this, fix C such that is of prime order and put and . Trivially there are at most conjugacy classes of that intersect nontrivially, and given , , we see that for ,
[TABLE]
and for each fixed , the equation implies which has at most solutions .
Moreover, if , then
[TABLE]
Now we define the character on by . Thus vanishes on all conjugacy classes of which intersect trivially, whereas for , we get
[TABLE]
and for , we get
[TABLE]
Thus if () are representatives of the conjugacy classes of , then
[TABLE]
and as in (1) we see that
[TABLE]
Now arguing as in (2), (3), (5) and (6) above will yield
[TABLE]
where is as defined at the beginning of 3. Putting the main results together, altogether we have proved the following:
3.3 **Theorem. *** Let be a finite group and let be a finite faithful –module of characteristic . Let and put . If () are representatives of the conjugacy classes of , then the following hold:
(a) If , then
[TABLE]
and if , then
[TABLE]
(b) If , then
[TABLE]
*and the bounds in (a) hold true for instead of .
(c) In general, if such that is a prime, then
[TABLE]
4 The dual approach
In the previous section, we always fixed and obtained bounds on the size of suitable subsets of in terms of properties of the action of on . In this section we consider a ”dual” approach:
We fix and find bounds in terms of the action of on . For this, put
[TABLE]
In particular, .
4.1 **Theorem. *** Let be a finite group and be a finite –module. Let such that . Write , and . Then
*(a)
(b) if is of prime order, then
[TABLE]
(c) there are such that is a disjoint union of and and
[TABLE]
[TABLE]
(d) if is of prime order and are as in (c), then
[TABLE]
Proof. If and , then it is straightforward to see that implies that . Hence if is a set of representatives of the orbits of on , then every conjugacy class of that intersects nontrivially with has a representative for some and some . Moreover, for each we have that if , are –conjugate, then and are –conjugate and thus . This shows that for each there are at most conjugacy classes of intersecting nontrivially with . Hence altogether we see that there are at most
[TABLE]
conjugacy classes of which intersect nontrivially.
Moreover observe that for , , and we have
[TABLE]
because the condition first forces which implies (as is cyclic) , so , and then as , it follows that and . Now as by our hypothesis we have , we see that now forces and . Hence .
Note that the direct product is a subgroup of . We now define a generalized character on by
[TABLE]
where is the regular character of . So for , we have
[TABLE]
Therefore vanishes on all conjugacy classes of which intersect trivially, whereas for and we have
[TABLE]
Thus if is a set of representatives for the conjugacy classes of , then by (1) and (2) we see that
[TABLE]
Observe that in case that is of prime order, then
[TABLE]
and , so that (3) becomes
[TABLE]
Since is a direct product, we can write
[TABLE]
where is a character of or . Then
[TABLE]
As (\lambda,\mu)_{C}=\left\{\begin{array}[]{ll}1,&\lambda=\mu\\ 0,&\lambda\not=\mu\end{array}\right., we further obtain
[TABLE]
Now observe that .
If all the are multiples of , then clearly , and so if , then by [4, Corollary 4] with (4) we see that
[TABLE]
So (3) and (5) yield
[TABLE]
and if is of prime order, then (3a) and (5) yield
[TABLE]
Now as in Section 3, we now repeat the same arguments, but use
[TABLE]
instead of .
One can then easily check that
[TABLE]
and if is of prime order, then
[TABLE]
Moreover it is easily seen that
[TABLE]
and as \sum\limits_{1\not=c\in C}\lambda(c)\overline{\mu(c)}=\left\{\begin{array}[]{ll}-1,&\mbox{if }\lambda\not=\mu\\ |C|-1,&\mbox{if }\lambda=\mu\end{array}\right., it follows that
[TABLE]
where ”” is an arbitrary ordering on .
Next suppose that there are exactly characters such that there is a character of (depending on ) and there are () such that for all and is not a multiple of . Then by (4) and [4, Corollary 4] we know that
[TABLE]
and hence by (3) we get
[TABLE]
and if is of prime order, then by (3a) even
[TABLE]
Now let be the number of such that there is no such .
Then there exist with
[TABLE]
and thus by [4, Corollary 4] we have
[TABLE]
So (3b) and (9) yield
[TABLE]
and, if is of prime order, then by (3c)
[TABLE]
and clearly , and hence all the assertions follow and we are done.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Guralnick, P. H. Tiep, The non–coprime k ( G V ) 𝑘 𝐺 𝑉 k(GV) –problem, J. Algebra 279 (2004), 694–719.
- 2[2] T. M. Keller, Fixed conjugacy classes of normal subgroups and the k ( G V ) 𝑘 𝐺 𝑉 k(GV) –problem, J. Algebra 305 (2006), 457–486.
- 3[3] R. Knörr, On the number of characters in a p 𝑝 p –block of a p 𝑝 p –solvable group, Illinois J. Math 28 (1984), 181–209.
- 4[4] G. R. Robinson, A bound on norms of generalized characters with applications, J. Algebra 212 (1999), 660–668.
- 5[5] P. Schmid, Some remarks on the k ( G V ) 𝑘 𝐺 𝑉 k(GV) –theorem, J. Group Theory 8 (2005), 589–604.
