1. Introduction
For a finite group G we let denote the set of irreducible characters of G. Then a multiplicity-free character of G is a character of G such that for , we have . Here only complex characters are considered.
A
Gelfand pair is a finite group
G together with a subgroup
H such that the trivial character of
H induces a multiplicity-free character of
G. The importance of Gelfand pairs is indicated by six equivalent conditions; see [
1,
2,
3,
4].
A
strong Gelfand pair is a finite group
G and
such that for every
the induced character
is multiplicity free. We will call
H a
strong Gelfand subgroup of G in this situation. Equivalently,
is a strong Gelfand pair if and only if the Schur ring determined by the
H-classes , is commutative [
3,
5,
6]. Here our convention is:
. Note that
is always a strong Gelfand pair.
In this paper we continue our investigation of strong Gelfand pairs of groups that are close to being simple; in [
1,
2,
7] we found all such pairs for
p a prime, and the symmetric groups. We refer to [
2,
3,
7] for necessary background and to [
8] for some of the latest results on strong Gelfand pairs.
We note that Gelfand pairs and strong Gelfand pairs have applications in representation theory; see [
8,
9,
10,
11] among many other references. As explained above, an equivalent condition for
to be a strong Gelfand pair is that the Schur ring determined by the
H-classes is commutative. This shows that a strong Gelfand pair determines a commutative Schur ring and so a commutative association scheme, which then indicates connections with algebraic combinatorics. One other application of strong Gelfand pairs is to random walks on finite groups: if
is a strong Gelfand pair, then one can define a random walk on
G using probabilities that are constant on the above mentioned
H-classes. The commutativity property of the
H-classes means that the random walk is `diagonalizable’ and so can be very well understood.
This paper will consider strong Gelfand pairs for the symplectic groups Sp
4(2
n) as their irreducible characters are known [
12]. In contrast, the irreducible characters of
are not understood, where
q is a prime power. The groups
are simple and the representation theory of these groups is considered in [
13]. The main result of this paper is:
Theorem 1. The only strong Gelfand pair ( is where .
Throughout we will use the standard Atlas notation [
14].
2. Preliminary Results
All groups considered in this paper will be assumed finite. For a group
G, the
total character of
G, denoted
, is the sum of all the irreducible characters of
G; see [
15,
16,
17]. The following gives the `total character argument’ for showing that certain subgroups are not strong Gelfand subgroups:
Lemma 1 (Lemma
[
7]).
Let be groups. If there is withthen is not a strong Gelfand pair. The following indicates that it is important to determine which maximal subgroups are strong Gelfand pairs.
Lemma 2 (Lemma
[
2]).
Suppose we have groups . If is not a strong Gelfand pair, then neither is . For
,
, we find from Table
of [
18] that the maximal subgroups of
are as listed in
Table 1.
Table 1 has the maximal subgroup
listed twice because there are two non-conjugate maximal subgroups of
which are isomorphic to
.
From Lemma 2 Theorem 1 will follow if we can show that none of these maximal subgroups is a strong Gelfand subgroup. We consider each case separately.
The next two results will allow us to assume .
We first consider the symplectic group
; since
the result here follows from our consideration of the symmetric groups in [
1]:
Proposition 1. The only proper subgroups of which are strong Gelfand subgroups are the maximal subgroups.
Proposition 2. No proper subgroup of is a strong Gelfand subgroup.
Proof. We use the MAGMA [
19] code given in the
Appendix A to obtain this result. □
In what follows we will often have the situation where
. We introduce the following conventions. For
it is well-known [
20] that either
- (i)
is a sum of two distinct characters in (call this the splitting case); or
- (ii)
is irreducible (call this the fusion case).
In the splitting case, if , then
In the situation the relationship between and is given in:
Lemma 3. Let . Let be the set of that split and let be the set of that fuse. Then The character table for
is given in [
12] and we will use notation from [
12].
Theorem 2 - (i)
The degree of the total character of is if q is even.
- (ii)
The largest degree of an irreducible character of is when is a power of 2.
Proof. (i) We just sum the degrees of characters of
as listed in [
12]. (ii) follows directly from [
12]. □
Lemma 4. If , then and .
Proof. See Proposition
and Table
of [
18]. □
We now consider the maximal subgroups separately in the following sections.
3. The Maximal Subgroup
Theorem 3. For the maximal subgroup is not a strong Gelfand subgroup.
Proof. This proof will be a `total character argument’ and so we will need to find the total character of . We have :2 and one way to represent the elements of :2 is by blocks of matrices, where the cyclic subgroup 2 is generated by and is represented as the block matrix
Now
has character table given in [
21] (see also [
7]); we reproduce it here in
Table 2. Here the parameters
satisfy
,
,
is a primitive
-th root of unity and
a primitive
-th root of unity.
Here the conjugacy classes of
are represented by powers of the following elements:
and an element
b of order
. We also give the sizes of the classes in
Table 2.
Since
:2 the irreducible characters of
are easily found using
Table 2. In
Table 3 we give the degrees of the irreducible characters of
. These character degrees are obtained using ([
20], [Proposition
, Theorem
]). Further, in
Table 3 we are assuming that
In
Table 3 the suffices
are written to indicate that these are the split cases. The lack of such a suffix indicates the fusion cases. In
Table 3 each case has a certain `Multiplicity’ that is also indicated; this depends on the parameters involved. Then from
Table 3 we obtain the degree of the total character of
:
Now , and by Theorem 2 is the degree of an irreducible character of . Then by Lemma 1 is not a strong Gelfand pair. □
By Lemma 4 and the fact that the above argument is a `total character argument’ (not dependent on the particular embedding of
in
) we see that we have now also dealt with the maximal subgroup
case from
Table 1:
Corollary 1. The maximal subgroup is not a strong Gelfand subgroup.
4. The Maximal Subgroups :
By Theorems 1 and 2 we may assume that .
Theorem 4. For , the maximal subgroup is not a strong Gelfand subgroup.
Proof. In [
12] two isomorphic maximal subgroups are considered; they are denoted
P and
Q. The orders of
P and
Q are
and they are isomorphic to
:
. The character tables for these subgroups are given in [
12].
We take the inner product of the character of
P denoted by
in [
12] with a character of
restricted to
P, namely
. In what follows
is the notation used in [
12] for the classes of
P; further, the sizes of these classes are also given in [
12]. Using all of this information we obtain:
Here where , and is the image of under a fixed monomorphism from into , making a -th root of unity. For clarity of notation, in our calculations we omit the overline.
Now supposing that
, if we have
, then the above gives
. We will now show that there is a choice of
so that
is equal to
. We calculate:
and notice that each of these four sums will be
if
divides
j, and
otherwise. Suppose that
and choose
. Then
and
, as required. We also have that only one of
is congruent to zero mod
. This gives
Then for
we have:
showing that
is not a strong Gelfand pair if
.
A similar argument shows that is also not a strong Gelfand pair. □
5. The Maximal Subgroups :2 and
The elements of the field can be represented as matrices over . This shows how . The action of the 2 in :2 is the Galois action.
Theorem 5. For the pair : is not a strong Gelfand pair.
Proof. Let
and
. Using
Table 2 we get the character table for
H; see
Table 4 where
and
. □
In order to find the degree of
, we will need to determine which characters of
H split and which fuse; it will suffice to determine which characters of
H induce to irreducible characters of
G. Again from [
20], since
we know that, by inducing, every character in
either splits into a sum of two irreducible characters or fuses pairwise into irreducible characters in
. We use Lemma 3 and
Table 4 to give:
Proposition 3. Let . Then
- (i)
splits;
- (ii)
ψ splits;
- (iii)
all fuse;
The characters sometimes split, but not always:
- (iv)
is irreducible if ; and
- (v)
is the sum of two irreducible characters if .
Proof. - (i)
It is clear that splits.
- (ii)
Since and there is no other character of degree we see that cannot fuse.
- (iii)
It will suffice to show that
. Now a calculation shows that
is as described in the following table, where
is a primitive
-th root of unity.
| | c | | | |
|
| | | 0 | | 0 |
Now
and for
we have
g and
are conjugate. Thus
Using
Table 2 again and taking
the above is equal to
Now, since
, the above is
as required for (iii).
- (iv)
Now a calculation shows that
is as described in the following table, where
is a primitive
-th root of unity.
| | c | | | |
|
| | 2 | | 0 | 0 |
We again examine
to see when we obtain 1. Taking
an argument similar to the
case gives
Here we used the facts that
and
, since
. Now, since
, only one of
or
can be true, this shows that the above is equal to
Since there are
values of
s for which
and
values where
, we see that
characters
of
H split in
G. Then the remaining
characters fuse in
G. Recall that
and
. So
By Theorem 2
is the largest degree of an irreducible character of
. Since
and
by Lemma 1
:
is not a strong Gelfand pair. □
Similar to Corollary 1 we see that by Lemma 4 and the fact that the above argument is a `total character argument’ (not dependent on the particular embedding of :2 in ) we have:
Corollary 2. The maximal subgroup is not a strong Gelfand subgroup.
Theorem 6. For , and such that for a prime r, the maximal subgroup is not a strong Gelfand subgroup.
Proof. By Theorem 2
for all even
q. Then
and since
and
we see that
This shows that
and so by Lemma 1
is not a strong Gelfand pair. □
Theorem 7. For , with n a positive integer, the maximal subgroup in is not a strong Gelfand subgroup.
Proof. In [
22] Suzuki gives the irreducible characters of
, where
. They are:
- (i)
the trivial character of degree 1;
- (ii)
a doubly transitive character of degree ;
- (iii)
characters of degree ;
- (iv)
two complex characters of degree ;
- (v)
characters of degree ;
- (vi)
characters of degree .
This gives the following expression for
:
We now notice that the degree of the total character of is smaller than the maximal degree of an irreducible character in by Theorem 2. This shows by Lemma 1 that is not a strong Gelfand pair when . □
This completes consideration of all the maximal subgroups listed in Table 1 and so concludes the proof of Theorem 1.
Author Contributions
Each author had a part in the conceptualization, methodology, software, validation, formal analysis, investigation, resources, data curation, writing—original draft preparation, writing—review and editing, visualization, supervision and project administration. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.
Acknowledgments
All computations made in the writing of this paper were accomplished using Magma [
19]. Thanks are due to some anonymous referees for helpful comments.
Conflicts of Interest
The authors declare no conflicts of interest.
Appendix A
IsStrongGelfandPair := function(g, h);
tf := true;
ctg := CharacterTable(g);
cth := CharacterTable(h);
for character in ctg do
r := Restriction(character, h);
for i := 1 to #cth do
if InnerProduct(r, cth[i]) gt 1 then
tf :=false;
break character;
end if;
end for;
end for;
return tf;
end function;
G := SymplecticGroup(4,4);
[IsStrongGelfandPair(G, u'subgroup) :
u in MaximalSubgroups(G)];
References
- Anderson, G.; Humphries, S.P.; Nicholson, N. Strong Gelfand pairs of symmetric groups. J. Algebra Appl. 2021, 20, 2150054. [Google Scholar] [CrossRef]
- Barton, A.; Humphries, S.P. Strong Gelfand Pairs of SL(2, p). J. Algebra Appl. 2023, 22, 2350133. [Google Scholar] [CrossRef]
- Ceccherini-Silberstein, T.; Scarabotti, F.; Tolli, F. Harmonic Analysis on Finite Groups, in Representation Theory, Gelfand Pairs and Markov Chains; Cambridge Studies in Advanced Mathematics, Cambridge University Press: Cambridge, UK, 2008; Volume 108, pp. xiv+440. [Google Scholar]
- Wikipedia contributors. “Gelfand pair”. Wikipedia, The Free Encyclopedia, 25 May 2021. Available online: https://en.wikipedia.org/wiki/Gelfand_pair (accessed on 29 July 2025).
- Karlof, J. The Subclass Algebra Associated with a Finite Group and Subgroup. Amer. Math. Soc. 1975, 207, 329–341. [Google Scholar] [CrossRef]
- Travis, D. Spherical Functions on Finite Groups. J. Algebra 1974, 29, 65–76. [Google Scholar] [CrossRef]
- Gardiner, J.C.; Humphries, S.P. Strong Gelfand pairs of SL(2, pn). Comm. Algebra 2024, 52, 3269–3281. [Google Scholar] [CrossRef]
- Brou, K.G.; Coulibaly, P.; Kangni, K. Generalized Gabor transform for a strong Gelfand pair. J. Adv. Math. Stud. 2025, 18, 109–121. [Google Scholar]
- Aizenbud, A.; Gourevitch, D.; Rallis, S.; Schiffmann, G. Multiplicity one theorems. Ann. Math. 2010, 172, 1407–1434. [Google Scholar] [CrossRef]
- Aizenbud, A.; Gourevitch, D. Multiplicity one theorem for (GLn+1(
),GLn()). Selecta Math. 2009, 15, 271–294. [Google Scholar] [CrossRef]
- Chan, K.Y. Ext-multiplicity theorem for standard representations of (GLn+1,GLn). Math. Z. 2023, 303, 45. [Google Scholar] [CrossRef]
- Enomoto, H. The characters of the finite symplectic group Sp(4, q), q = 2f. Osaka Math. J. 1972, 9, 75–94. [Google Scholar]
- Dabbaghian-Abdoly, V. Characters of some finite groups of Lie type with a restriction containing a linear character once. J. Algebra 2007, 309, 543–558. [Google Scholar] [CrossRef]
- Conway, J.H.; Curtis, R.T.; Norton, S.P.; Parker, R.A.; Wilson, R.A. Atlas of Finite Groups. In Maximal Subgroups and Ordinary Characters for Simple Groups; With Computational Assistance from J. G. Thackray; Oxford University Press: Eynsham, UK, 1985; pp. xxxiv+252. [Google Scholar]
- Humphries, S.; Kennedy, C.; Rode, E. The total character of a finite group. Algebra Colloq. 2015, 22, 775–778. [Google Scholar] [CrossRef]
- Prajapati, S.K.; Sarma, R. Total character of a group G with (G, Z(G)) as a generalized Camina pair. Canad. Math. Bull. 2016, 59, 392–402. [Google Scholar] [CrossRef]
- Prajapati, S.K.; Sury, B. On the total character of finite groups. Int. J. Group Theory 2014, 3, 47–67. [Google Scholar]
- Bray, J.N.; Holt, D.F.; Roney-Dougal, C.M. The Maximal Subgroups of the Low-Dimensional Finite Classical Groups. With a Foreword by Martin Liebeck; London Mathematical Society Lecture Note Series, 407; Cambridge University Press: Cambridge, UK, 2013. [Google Scholar]
- Bosma, W.; Cannon, J.; Playoust, C. The Magma algebra system. I. The user language. J. Symbolic Comput. 1997, 24, 235–265. [Google Scholar] [CrossRef]
- James, G.D.; Liebeck, M.W. Representations and Characters of Groups, 2nd ed.; Cambridge University Press: Cambridge, UK, 2001. [Google Scholar]
- Dornhoff, L. Group Representation Theory. Part A: Ordinary Representation Theory; Pure and Applied Mathematics; Marcel Dekker, Inc.: New York, NY, USA, 1971; Volume 7, pp. vii+254. [Google Scholar]
- Suzuki, M. A new type of simple groups of finite order. Proc. Nat. Acad. Sci. USA 1960, 46, 868–870. [Google Scholar] [CrossRef] [PubMed]
Table 1.
Maximal subgroups of , for .
Table 1.
Maximal subgroups of , for .
Group | Order | Conditions |
---|
| | |
| | |
| | |
| | |
| | is prime |
| | |
| | |
| | e odd |
Table 2.
Character Table for with q even.
Table 2.
Character Table for with q even.
Class | 1 | c | | |
Size | 1 | | | |
Tr | 1 | 1 | 1 | 1 |
| q | 0 | 1 | |
| | 1 | | 0 |
| | | 0 | |
Table 3.
Character degrees for with q even.
Table 3.
Character degrees for with q even.
Character | Degree | Multiplicity |
---|
| 1 | 1 |
| 1 | 1 |
| | 1 |
| | |
| | |
| | 1 |
| | 1 |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
Table 4.
Character degrees for with q even.
Table 4.
Character degrees for with q even.
Character | Degree | Multiplicity |
---|
Tr | 1 | 1 |
| | 1 |
| | |
| | |
| Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).