Smith and Critical groups of Polar graphs.
Venkata Raghu Tej Pantangi
[email protected]
and
Peter Sin
[email protected]
Department of Mathematics, University of Florida, Gainesville, FL 32611-8105, USA.
Abstract.
We compute the elementary divisors of the adjacency and Laplacian matrices of families of polar graphs. These graphs have as vertices the isotropic one-dimensional subspaces of finite vector spaces with respect to non-degenerate forms, with adjacency given by orthogonality.
Key words and phrases:
invariant factors, elementary divisors, Smith normal form, critical group, sandpile group, adjacency matrix, Laplacian, Polar graph.
This work was partially supported by a grant from the Simons Foundation (#204181 to Peter Sin).
1. Introduction
Let Γ=(V~,E~) be an undirected simple connected graph. Let A be the adjacency matrix of Γ with respect to some arbitrary ordering of V~. Let D be the diagonal matrix with Dii being the degree of the ith vertex of Γ. Then L:=D−A is called the Laplacian matrix of Γ. Multiplication by A and L are endomorphisms of ZV~, the free Z module with V~ as a basis set. The cokernel of A is called the Smith group S(Γ) of Γ. The finite part of cokernel of L is called the critical group K(Γ) of Γ. As a consequence of Kirchhoff’s Matrix Tree Theorem, the order of K(Γ) is equal to the number of spanning trees of Γ (cf. [14]). The critical groups of various graphs arise in combinatorics in the context of chip firing games (cf. [1]), as the abelian sandpile group in statistical mechanics (cf. [6]), and also in arithmetic geometry. One may refer to [11] for a discussion on these connections. It is therefore of some interest to compute the Smith groups and critical groups of graphs.
In this paper, we calculate the Smith groups and critical groups of families of polar graphs.
These graphs are strongly regular graphs (SRGs) associated with finite classical polar spaces. Given a finite classical polar space P associated with a quadratic, symplectic or hermitian space V, the polar graph Γ(V) is the graph whose vertex set is the set P0 of points of P (isotropic 1-dimensional subspaces of V) and whose adjacency is defined by orthogonality with respect to the underlying form. We have six infinite families of polar graphs arising from the six families of finite classical polar spaces.
Throughout the paper the Smith and critical groups of Γ(V) will be denoted by S and K respectively. The computation of S and K is equivalent
to finding the elementary divisors of A and L, so can be carried out one prime at a time. The group G(V) of form-preserving isomorphisms on V acts a group of automorphisms of Γ(V). We use properties of strongly regular graphs and modular representation theory of G(V) to compute S and K. This methodology is an extension of the methodologies used for other computations in the literature, as found in [2], [5], [12] and [7].
Our results giving the elementary divisors of S and K for every polar graph
are stated in §3. The structures of K and S depend on the
relationship of primes to various combinatorial parameters of Γ(V)
which we treat first in §2. Then in §3 the
multiplicity of elementary divisors are given in twelve tables, corresponding
to S and K for each of the six families of polar spaces.
We now describe our approach in more detail.
Let us consider a matrix X∈Mn×n(Z), a prime ℓ, and a positive integer a∈Z≥0. By e0 we denote the ℓ-rank of X and for a=0 let ea be the multiplicity of ℓa as an elementary divisor of the finite part of Zn/X(Zn). Let Zℓ be the ring of ℓ-adic integers and Fℓ=Zℓ/ℓZℓ the field of ℓ-elements.
In §4, we establish some general results on elementary divisors by relating them to
the Zℓ-modules Ma:={y∈Zℓn∣Xy∈ℓaZℓn} and the Fℓ-modules Ma:=(Ma+ℓZℓn)/ℓZℓn. By the structure theorem
for finitely generated modules over a principal ideal domain, we have ea=dim(Ma/Ma+1).
Suppose X is now either the adjacency matrix A or the Laplacian matrix L of Γ(V). As Γ(V) is a strongly regular graph, X has three distinct eigenvalues. When a prime ℓ divides at most two of the three eigenvalues, the reduction Xℓ of X modulo ℓ has non-zero eigenvalues. If ℓ divides all three eigenvalues, then Xℓ is nilpotent. The division into the nilpotent and non-nilpotent cases
is an important one from a technical point of view, and is also reflected in structure of S and K.
The nilpotence of Xℓ is characterized by a few arithmetic conditions together with the geometry on V. Table 13 of §5 encodes this characterization.
The non-nilpotent case turns out to be much easier to handle
than the nilpotent case; general properties of strongly regular graphs and elementary linear algebra suffice. In §6 we compute the ℓ-elementary divisors of S and K when Xℓ is not nilpotent. In this case, we show that each Mi is either im(Xℓ−αI) or ker(X−αI) for some eigenvalue α of X.
When Xℓ is nilpotent, we use more representation theory.
As G(V) preserves adjacency, X may be viewed as a ZℓG(V)-endomorphism of the ZℓG(V)-permutation module ZℓP0, and the modules Ma introduced above are FℓG(V)-submodules of the FℓG(V)-permutation module
FℓP0.
The action of G(V) on P0 has permutation rank 3. The submodule structure of the permutation module FℓP0 has been determined in [10], [9], [8], and [13] in cross-characteristics, that is, when
ℓ is not equal to the characteristic of the underlying field of the polar space.
From the submodule structures determined in [10], [9], [8], and [13] it can be seen that the length of FℓP0 is at most 6. Thus we expect at most five distinct ℓ-elementary divisors for S and K. Using the information
about submodules we locate the submodules Mi in the submodule lattice and thereby determine the dimensions of the submodules Mi. This detailed analysis, which forms the bulk of the paper, is carried out in §7 to §13. The identification of the submodules Mi of FℓP0 is a further refinement of
the detailed picture of the submodule structure of permutation modules for classical groups, and may be of independent interest.
2. Definitions and Notation
Definition 1**.**
A strongly regular graph (SRG) with parameters (v~,k~,λ~,μ~) is a k~-regular graph on v~ vertices such that:
- (1)
Any two adjacent vertices have λ~ neighbours;
2. (2)
Any two non-adjacent vertices have μ~ neighbours.
Let q=pt be a power of a prime, and let Fq, Fq2 be finite fields of order q, and q2 respectively. Let V be either a vector space over Fq endowed with a non-degenerate symplectic form, a quadratic form, or a vector space over Fq2 carrying a non-degenerate Hermitian form. By q~, we denote the size of the underlying field associated with V. We note that q~=q2 in the Hermitian case and is q in the other cases.
Let P0 be the set of all singular 1-spaces in V. Given two distinct v,u∈P0, we say v∼u if and only if v and u are orthogonal. Let Γ(V) be the graph on P0, whose adjacency is defined by the relation ∼.
Based on the parity of dim(V) and the geometry on V, we classify Γ(V) into six families. We associate a parameter h∈{0,21,1,23,2} with each family. Another parameter associated with each family is the dimension of the maximal totally isotropic subspace of V, denoted by z. The graph Γ(V) is a graph on (q~z−1+h+1)q~−1q~z−1 vertices, where q~ is the size of the underlying field. Any strongly regular Γ(V) is isomorphic to one of the following graphs.
- (1)
When V=Fq2m is a symplectic space (with m≥2), we denote Γ(V) by Γs(q,m). In this case h=1, z=m, and Sp(2m,q)≤Aut(Γs(q,m)).
2. (2)
When V=Fq2m+1 is an endowed with a non-degenerate quadratic form (with m≥2), we denote Γ(V) by Γo(q,m). In this case h=1, z=m, and O(2m,q)≤Aut(Γo(q,m)).
3. (3)
When V=Fq2m (with m≥3) is endowed with a non-degenerate elliptic quadratic form, we denote Γ(V) by Γo−(q,m). In this case h=2, z=m−1, and O−(2m,q)≤Aut(Γo−(q,m)).
4. (4)
When V=Fq2m (with m≥3) is endowed with a non-degenerate hyperbolic quadratic form, we denote Γ(V) by Γo+(q,m). In this case h=0, z=m, and O+(2m,q)≤Aut(Γo+(q,m)).
5. (5)
When V=Fq22m (with m≥2) is endowed with a non-degenerate Hermitian quadratic form, we denote Γ(V) by Γue(q,m). In this case h=21, z=m, and U(2m,q2)≤Aut(Γue(q,m)).
6. (6)
When V=Fq22m+1 (with m≥2) is endowed with a non-degenerate Hermitian quadratic form, we denote Γ(V) by Γuo(q,m). In this case h=23, z=m, and U(2m+1,q2)≤Aut(Γue(q,m)).
From now on, we assume that Γ(V) is one of the six graphs described above.
A polar graph is a graph of the form Γ(V).
By G(V), we denote the group of form-preserving automorphisms of V. For example when Γ(V)=Γs(q,m), we have G(V)=Sp(2m,q).
We denote the number of j-dimensional subspaces of Fqd, by [jd]q. By standard counting arguments we have [jd]q=∏i=1jq−1qd−i+1−1. Note that q may be replaced by a variable z to define [jd]z:=∏i=1jz−1zd−i+1−1.
By standard arguments (cf. [3] §9.5), we can deduce the following result.
Lemma 2**.**
The graph Γ(V) is a strongly regular graph with parameters
[TABLE]
Here q~=q2 when Γ(V) is either Γue(q,m) or Γuo(q,m); and q~=q in other cases.
Given a matrix X∈Mn×m(Z), let Ab(X) be the finite part of Zn/X(Zm). Now if we are given a prime ℓ and a positive integer a, by ea we denote the multiplicity of ℓa as an elementary divisor of the matrix X. Then e0 is the ℓ-rank of X and for a>0, the multiplicity of ℓa as an elementary divisor of Ab(X) is ea, by the structure theorem
for finitely generated abelian groups.
Throughout the paper, the adjacency and Laplacian matrices of Γ(V) will be denoted by A and L. The Smith group of Γ(V) is Ab(A) and the critical group is Ab(L). Throughout the paper, S and K will denote the Smith and critical groups of Γ(V) respectively.
It follows from the definition of strongly regular graphs (cf. [4] Theorem 8.1.2) that A satisfies A2−(μ−λ)A+(μ−k)I=μJ. Here J is the matrix of all ones.
By observing that 1:=y∈P0∑y is an eigenvector for A, corresponding to the eigenvalue k, we have
(A−kI)(A2−(μ−λ)A+(μ−k)I)=0.
Using this relation, the following Lemma can be derived using elementary linear algebra.
Lemma 3**.**
Let A be an adjacency matrix of Γ(V), then L=kI−A is the Laplacian. Let r be the positive root of z2−(μ−λ)z+(μ−k), and s the negative root. Let t=k−r, and u=k−s. Then the following hold.
- (1)
We have r=q~z−1−1, s=−(q~z−2+h+1),
t= [1z−1]q~(q~z−1+h+1),
and u=(q~z−2+h+1)[1z]q~.
2. (2)
A* has three eigenvalues, (k,r,s) with multiplicities (1,f,g). Where,*
f=(q~−1)(q~h−1+1)q~h(q~z−2+h+1)(q~z−1), and g=(q~−1)(q~h−1+1)q~(q~z−1+h+1)(q~z−1−1).
3. (3)
L* has eigenvalues (0,t,u):=(0,k−r,k−s) with multiplicities (1,f,g).*
4. (4)
(z−k)(z−r)(z−s)* is the minimal polynomial of A and (z)(z−t)(z−u) is the minimal polynomial of L.*
5. (5)
(A−rI)(A−sI)=μJ.
6. (6)
(L−tI)(L−uI)=−μJ.
7. (7)
(z−kI)(z−rI)f(z−sI)g* is the characteristic polynomial of A.*
8. (8)
z(z−tI)f(z−uI)g* is the characteristic polynomial of L.*
As A is a non-singular matrix, the order of the Smith group S=∣det(A)∣ and thus,
∣S∣=krfsg.
As a consequence of Kirchhoff’s Matrix Tree Theorem (cf. [14]), we have ∣K∣=vtfug.
3. Main Results
Our main results are presented in Theorems 4 and 5 below. A Polar graph as defined in the previous section is isomorphic to one of Γs(q,m) (with m≥2), Γo(q,m) (with m≥2), Γo−(q,m) (with m≥3), Γo+(q,m) (with m≥3), Γue(q,m) ( with m≥2), and Γuo(q,m) (with m≥2). Theorem 4 describes the Smith groups of polar graphs and Theorem 5 the critical groups. Corresponding to the six families of Polar graphs, the six tables following Theorem 4 (respectively Theorem 5) encode the multiplicities of elementary divisors of the Smith (resp. critical) groups of these families of graphs.
Given a prime ℓ, the multiplicity ei of ℓi as an elementary divisor of A (respectively L) is given in terms of parameters defined in the first two rows of the Tables 1 to 6 (respectively Tables 7 to 12). The parameters x, f, g defined in the first rows of the tables are dimensions of certain G(V) representations. In particular, f and g are the multiplicities of the eigenvalues r and s (of A) respectively.
The second rows define parameter a, d, w (respectively a, b, c, d in the case of L) as ℓ-adic valuations of certain divisors of eigenvalues k, r, s of A (respectively t, u of K). We note that vℓ(r)=a+w, vℓ(s)=d, vℓ(k)=a+d, vℓ(t)=a+c, and vℓ(u)=b+d.
Example 1*.*
The 4th and 5th rows of table 7 show that the 2-elementary divisors L when Γ(V)=Γs(q,m) (with q odd)
i) are 20, 21, 2d+1, 2d+b+1 with multiplicities g+1, f−g−1, 1, and g−1 respectively, when m is even;
ii) and are 20, 21, 2a+c, 2a+c+1 with multiplicities g, 1, f−g−1, and g respectively, when m is odd.
Parameters a, b, c, d, f and g are as defined in the first two rows of table 7.
Theorem 4**.**
Let V be a either a vector space over Fq endowed with a non-degenerate symplectic form, quadratic form, or a vector space over Fq2 carrying a non-degenerate Hermitian form.
Further assume dim(V)≥4 when V is carrying a symplectic/Hermitian form, and dim(V)≥5 when V is endowed with a non-degenerate quadratic form.
Consider the graph Γ(V), its Smith group S and a prime ℓ∣∣S∣.
If ℓ=p, the ℓ-part of S is Z/q2Z when Γ(V) is either Γue(q,m) orΓuo(q,m), and Z/qZ in other cases.
If ℓ=p, the elementary divisors of S are as described in Tables 1, 2, 3, 4, 5, and 6. In these, δij is 1 if i=j and [math] otherwise.
See §6 (set h=1 and z=m) and §8 for computation of the Smith group of Γs(q,m).
See §6 (set h=1 and z=m) and §9 for the computation of the Smith group of Γo(q,m).
See §6 (set h=2 and z=m−1) and §10 for computation of the Smith group of Γo−(q,m).
See §6 (set h=0 and z=m) and §11 for the computation of the Smith group of Γo+(q,m).
See §6 (set h=1/2 and z=m) and §12 for the computation of the Smith group of Γue(q,m).
See §6 (set h=3/2 and z=m) and §13 for the computation of the Smith group of Γuo(q,m).
Theorem 5**.**
Let V be a either a vector space over Fq endowed with a non-degenerate symplectic form, quadratic form, or a vector space over Fq2 carrying a non-degenerate Hermitian form.
Further assume dim(V)≥4 when V is carrying a symplectic/Hermitian form, and dim(V)≥5 when V is endowed with a non-degenerate quadratic form.
Consider the graph Γ(V), its critical group K and a prime ℓ∣∣K∣. The ℓ-elementary divisors of K are as described in Tables 7, 8, 9, 10, 11, and 12. In these, δij is 1 if i=j and [math] otherwise.
See §6 (set h=1 and z=m) and §8 for computation of the critical group of
Γs(q,m).
See §6 (set h=1 and z=m) and §9 for the computation of the critical group of Γo(q,m).
See §6 (set h=2 and z=m−1) and §10 for computation of the critcal group of Γo−(q,m).
See §6 (set h=0 and z=m) and §11 for the computation of the critical group of Γo+(q,m).
See §6 (set h=1/2 and z=m) and §12 for the computation of the critical group of Γue(q,m).
See §6 (set h=3/2 and z=m) and §13 for the computation of the critical group of Γuo(q,m).
Remark*.*
We observe that the two families of polar graphs Γs(q,m) and Γo(q,m) are SRGs with the same parameters but different Smith and critical groups. This is an example where Smith and critical groups are distinguishing invariants for two families of isospectral graphs.
4. Smith normal form
Let R be any PID and T:Rm→Rn be a linear transformation. By the structure theorem for finitely generated modules over PIDs, we have {αi}i=1s⊂R∖{0} such that αi∣αi+1 and
[TABLE]
By [T] we denote the matrix representation of T with respect to standard bases. Then the above equation tells us that we can find P∈GL(Rn), and Q∈GL(Rm) such that
[TABLE]
where Y=diag(α1,…,αs). The matrix P[T]Q is called the Smith normal form of T.
Let ℓ∈R be a prime dividing αs. Given j∈Z≥0, we define ej(ℓ):=∣{αi∣ vℓ(αi)=j}∣. Now ej(ℓ) is the multiplicities of ℓj as an ℓ-elementary divisors of coker(T). If R=Z, then ej(ℓ) is the multiplicity of ℓj as an elementary divisor of the abelian group coker(T).
Let Rℓ be the ℓ-adic completion of R. We have
[TABLE]
Define Mj(T):={z∈Rℓm∣ T(z)∈ℓjRℓn}. For ease of notation, we denote Mj(T) by Mj and ej(ℓ) by ej.
We have Rℓm=M0(T)⊃M1(T)⊃…⊃Mn(T)⊃⋯.
Let F=Rℓ/ℓRℓ.
If M⊂Rℓm is a submodule, define M=(M+ℓRℓm)/ℓRℓm. Then M is an F-vector space.
The following Lemma follows from the structure theorem.
Lemma 6**.**
ej:=dim(Mj(T)/Mj+1(T)).
So we have,
[TABLE]
Following the notation in §\refnota, given a matrix C∈Mn×m(Z), the finite part of Zn/C(Zm) is denoted by Ab(C).
The following lemma, which will be applied frequently, is Lemma 3.1 of [7]. We include a short proof for the convenience of the reader.
Lemma 7**.**
Let C be an n×m integer matrix. Fix a prime ℓ and let d=vℓ(∣Ab(C)∣). Let Mi:=Mi(C) be as defined above and ei:=ei(ℓ) be the ℓ-elementary divisors of C. Suppose that we have two sequences of integers 0<t1<t2…<tj and s1>s2…>sj>sj+1=dim(ker(C)) satisfying the following conditions.
- (A)
dim(Mti)≥si, for all 1≤i≤j.
2. (B)
d=i=1∑j(si−si+1)ti.
Then the following hold.
- (a)
e0=m−s1.
2. (b)
eti=si−si+1.
3. (c)
ea=0* for a∈/{t1…ti,…tj}.*
Proof.
We have
[TABLE]
Application of equation (1) given above the lemma yields
[TABLE]
Now application of conditions (A) and (B) in the statement gives us
[TABLE]
So the inequalities (2) and (3) are in fact equations and thus the lemma follows.
∎
The following result is 12.8.4 of [4].
Lemma 8**.**
Let C be an n×n integer matrix with an integer eigenvalue ϕ with geometric multiplicity c. Fix a prime ℓ dividing both ∣Ab(C)∣ and ϕ, with vℓ(ϕ)=d. Then dim(Md(C))≥c.
Proof.
Let Vϕ be the eigenspace of Qℓn. Then Vϕ∩Zℓn is a pure Zℓ-submodule (Zℓ-direct summand) of
Zℓn of rank c. It is clear that Vϕ∩Zℓn⊂Md(C). As Vϕ∩Zℓn is pure, we have Vϕ∩Zℓn⊂Md(C).
∎
5. Nilpotence of A and K modulo ℓ.
We recall from §2 that Γ(V) is an SRG with parameters (v,k,λ,μ) specified in Lemma 2. Following notations fixed in §2, A will denote the adjacency matrix of Γ(V) and L=kI−A will denote the Laplacian matrix. By J, we denote the all-one matrix of same size as A. We also recall from Lemma 3 that A has eigenvalues k, r, s, with multiplicities 1, f , and g respectively; and that L has eigenvalues [math], t=k−r, u=k−s, with multiplicities 1, f , and g respectively. The values of r, s, t, u, f, and g are specified in Lemma 3. We also observed that ∣S∣=krfsg and that ∣K∣=vtfug.
Deducing from Lemma 3 that k=−q~sq~−1r, we see that ℓ∣∣S∣ if and only if ℓ∣q~rs. Since vtu is an integer, we see that ℓ∣∣K∣ if and only if ℓ∣tu. In the context of Lemma 8 and Lemma 7, it is useful to investigate the ℓ-adic valuations of eigenvalues r, s of A; and those of eigenvalues t and u of L.
Given X∈Mn×n(Z), by Xℓ we denote the reduction of X modulo ℓ. The matrix Xℓ is nilpotent if and only if all eigenvalues of X are divisible by ℓ. Now the discussion in the above paragraph and enables us to make the following observations.
-
Since the q~ is coprime to both r and s, we see that Aℓ is nilpotent if and only if ℓ∣r and ℓ∣s.
-
Lℓ is nilpotent if and only if ℓ∣t and ℓ∣u.
The following Lemma completely classifies all the pairs (Γ(V),ℓ) for which Aℓ or Lℓ is nilpotent.
Lemma 9**.**
Consider the graph Γ(V) and let X be either the adjacency matrix or the Laplacian matrix of Γ(V). Let ℓ be a prime and Xℓ be the reduction of X (modℓ). Then conditions for nilpotence of Xℓ are encoded in Table 13.
The proof follows by observing that Xℓ is nilpotent if and only if all three eigenvalues of X are divisible by ℓ.
Finding ℓ-elementary divisors of S and K in the “non-nilpotent” cases is a bit easier. Lemma 3 gives us (A−rI)(A−sI)=μJ and (L−tI)(L−uI)=−μJ.
In this case Lemma 8 and the equations above help us construct two integer sequences satisfying the hypothesis of Lemma 7. We will do these computations in §6.
In the “nilpotent” case, we use representation theory of G(V), the group of form preserving linear isomorphisms of V. Let us consider the case when ℓ is a “nilpotent” prime.
We may treat A and L as elements of EndZℓ(ZℓP0), where ZℓP0 is the free Zℓ module with P0 (vertex set of Γ(V)) as a basis. The action on P0 by elements of the group G(V) preserves adjacency and thus commutes with the actions of A and L.
This implies that the FℓP0 subspaces Mi(A) and Mi(L) constructed as in §4 are also FℓG(V)-submodules of the permutation module FℓP0. The action of G(V) on P0 has permutation rank 3. The submodule structure of the permutation module FℓP0 has been determined in [10], [9], [8], and [13] in cross-characteristics, that is, when
ℓ∤q~. We use these results along with Lemma 7 to finish our computations.
6. When Aℓ and Lℓ are not nilpotent.
In this section we deal with Γ(V) and a prime ℓ such that Aℓ and Lℓ are not nilpotent. Table 13 can be used to look up all possible pairs (V,ℓ) such that Aℓ (equivalently Lℓ) are not nilpotent.
6.1. Elementary divisors of S
The graph Γ(V) is one of Γs(q,m), Γo(q,m), Γo−(q,m), Γo+(q,m), Γuo(q,m) and Γue(q,m). Following the notation in Lemma 3, we have r=[1z−1]q~(q~−1), s=−(q~z−2+h+1), μ=[1z−1]q~(q~z−2+h+1), and k=q~μ. Here q~=q2 for Γuo(q,m) and Γuo(q,m); and q~=q for other graphs.
If ℓ∣∣S∣, we saw in §5 that Aℓ is not nilpotent if and only if ℓ does not divide r and s simultaneously. Assume that ℓ does not divide r and s simultaneously, and that ℓ∣∣S∣. As ∣S∣=krfsg and k=q~sq~−1r, we see that ℓ divides exactly one of q~, r, and s.
In this subsection, we identity Aℓ with A and Mi(A) with Mi.
6.1.0.1 Case 1: ℓ∣r and ℓ∤sq~.
We set vℓ([1z−1]q~)=a and vℓ(q~−1)=w. Then vℓ(s)=0, vℓ(k)=vℓ(μ)=a, vℓ(r)=a+w, and vℓ(∣S∣)=(a+w)f+a. As ℓ∣r, one of a and w is necessarily non-zero.
By Lemma 3, (z−k)(z−s)g(z−r)f is the characteristic equation of A. Reducing modulo ℓ, we see that zf(z−k)(z−s)g is the characteristic polynomial of A. By Lemma 3, we observe that minimal polynomial of L divides (z−k)(z−s)(z), and thus all the Jordan blocks of L associated with s have size 1. Therefore, the geometric multiplicity of s as an eigenvalue of A is g. We can now conclude that dim(im(A−sI))=f+1.
Lemma 3 give us A(A−sI)=−r(A−sI)+μJ. Since a=vℓ(μ)≤vℓ(r), we see that im(A−sI)⊂Ma. Thus dim(Ma)≥f+1.
As r is an eigenvalue of valuation a+w, Lemma 8 implies that dim(Ma+w)≥f.
We apply Lemma 7 to conclude the following.
- (1)
Assume that w=0, then a=0. As A is non-singular, ker(A)={0}. Now by Lemma 7, setting j=1, t1=a, s1=f+1≤dim(Ma), s2=0=dim(ker(A)), we have
ea=f+1, e0=g, and ei=0 for all other i.
2. (2)
Assume a=0, then w=0. As A is non-singular, ker(A)={0}. Now by Lemma 7, setting j=1, t1=w, s1=f≤dim(Mw), s2=0, we have
ew=f, e0=g+1 and ei=0 for all other i.
3. (3)
Assume aw=0. As A is non-singular, ker(A)={0}. Now by Lemma 7, setting j=2, t1=a+w,t2=w s1=f+1≤dim(Mw), s2=f≤dim(Mw), s3=0, we have
ea+w=1, ea=f, e0=g, and ei=0 for all other i.
6.1.0.2 Case 2: ℓ∣s and ℓ∤rq~.
Set vℓ(s)=d. As ℓ∤r, we have vℓ(r)=0. Then vℓ(k)=vℓ(μ)=d, and vℓ(∣S∣)=dg+d.
Lemma 3 gives us A(A−rI)=−s(A−rI)+μJ. This shows that im(A−rI)⊂Md.
By Lemma 3, z(z−s)g(z−r)f is the characteristic polynomial of A. Reducing mod ℓ, we see that zg+1(z−r)f is the characteristic polynomial of A. Also Lemma 3, we can deduce that z(z−r) is the minimal polynomial of A, and thus the geometric multiplicity of r as an eigenvalue of A is f. We can now conclude that dim(im(A−rI))=g+1.
Therefore dim(Md)≥g+1. So by Lemma 7, setting j=1, s1=g+1, s2=0, and t1=d, we have ed=g+1, e0=f and ei=0 for all other i.
6.1.0.3 Case 3: ℓ∣q~ and ℓ∤rs.
Set vℓ(q~)=ϵ. Then vℓ(k)=vℓ(∣S∣)=a.
As k is an eigenvalue of valuation ϵ, Lemma 8 shows that dim(Mϵ)≥1. Thus by Lemma 7, we deduce that eϵ=1, e0=f+g, and ei=0 for all other i.
6.2. Elementary divisors of K
The graph Γ(V) is one of Γs(q,m), Γo(q,m), Γo−(q,m), Γo+(q,m), Γuo(q,m) and Γue(q,m). Following the notation in Lemma 3, we have μ=[1z−1]q~(q~z−2+h+1), t=[1z−1]q~(q~z−1+h+1),
u=(q~z−2+h+1)[1z]q~. and v=[1z]q~(q~z−1+h+1). Here q~=q2 for Γuo(q,m) and Γuo(q,m); and q~=q for other graphs.
If ℓ∣∣K∣, we saw in 5 that Lℓ is not nilpotent if and only if ℓ does not divide t and u simultaneously. Assume that ℓ does not divide t and u simultaneously, and that ℓ∣∣K∣. We recall that ∣K∣=tfug/v.
In this subsection, we identity Lℓ with L and Mi(L) with Mi.
6.2.0.1 Case 1: ℓ∣t and ℓ∤u.
In this case, vℓ(t)>0 and vℓ(u)=0. We set vℓ([1z−1]q~)=a and vℓ((q~z−1+h+1))=c. Now, we have vℓ(t)=a+c, vℓ(μ)=a, and vℓ(v)=c. Since ∣K∣=tfug/v, we have vℓ(∣K∣)=(a+c)f−c.
As L is a matrix of nullity 1, we have dim(ker(L))=1.
As t is an eigenvalue of ℓ-valuation a+c and geometric multiplicity f. So Lemma 8 implies that dim(Ma+c)≥f.
Lemma 3 gives us L(L−uI)=−t(L−uI)−μJ. So im(L−uI)⊂Ma. Again by Lemma 3, z(z−u)g(z−t)f is the characteristic polynomial of L. Reducing mod ℓ, we see that zf+1(z−u)g is the characteristic polynomial of L. From Lemma 3 we deduce that minimal polynomial of L divides z2(z−u). Thus all the Jordan blocks of L associated with u are of size 1. Therefore the geometric multiplicity of u as an eigenvalue of L is g. We can now conclude that dim(im(L−uI))=f+1, and thus dim(Mc)≥f+1.
Using Lemma 7, we arrive at the following conclusions.
- (1)
Assume that a=0, then c=0. So by Lemma 7, setting j=1, s1=f, s2=dim(ker(L))=1 and t1=c, we have ec=f−1, e0=g+1, and ei=0 for all other i.
2. (2)
Assume c=0, then a=0. So by Lemma 7, setting j=1, s1=f+1, s2=dim(ker(L))=1 and t1=a, we have ea=f, e0=g, and ei=0 for all other i.
3. (3)
Assume ac=0. By Lemma 7, setting j=2, s1=f+1, s2=f, s3=dim(ker(L))=1 and t1=c, t2=a+c we have e0=g, ea=1, ea+c=f−1 and ei=0 for all other i.
6.2.0.2 Case 2: ℓ∣u and ℓ∤t.
In this case, vℓ(u)>0, and vℓ(t)=0. We set vℓ([1z]q~)=b and vℓ((q~z−2+h+1))=d. We have vℓ(u)=b+d, vℓ(μ)=d, and vℓ(v)=b. Since ∣K∣=tfug/v, we have vℓ(∣K∣)=(b+d)g−b.
As L is a matrix of nullity 1, we have dim(ker(L))=1.
Since u is an eigenvalue of valuation d+b and geometric multiplicity g, Lemma 8 implies dim(Md+b)≥g.
By Lemma 3, we have L(L−tI)=−u(L−tI)−μJ. So im(L−tI)⊂Md. Lemma 3 tells that z(z−u)g(z−t)f is the characteristic polynomial of L. Reducing modulo ℓ, we see that zf+1(z−t)g is the characteristic polynomial of L. From Lemma 3 we deduce that minimal polynomial of L divides z2(z−t). Thus all the Jordan blocks of L associated with t are of size 1. Therefore the geometric multiplicity of t as an eigenvalue of L is f. We can now conclude dim(im(L−tI))=g+1 and dim(Md)≥g+1.
We now apply Lemma 7 to conclude the following.
- (1)
Assume b=0, then d=0. So by Lemma 7, setting j=1, s1=g+1, s2=dim(ker(L))=1 and t1=d, we have e0=f, ed=g, and ei=0 for all other i.
2. (2)
Assume d=0, then b=0. So by Lemma 7, setting j=1, s1=g, s2=dim(ker(L))=1 and t1=b, we have e0=f+1, eb=g−1, and ei=0 for all other i.
3. (3)
Assume bd=0. Then by Lemma 7, setting j=2, s1=g+1, s2=g, s3=dim(ker(L))=1 and t1=d, t2=d+b we have e0=f, ed=1, ed+b=g−1 and ei=0 for all other i.
7. When Aℓ and Lℓ are nilpotent.
Let ℓ be a prime and Γ(V) be a polar graph such that Aℓ or Lℓ is nilpotent. In this case, we use representation theory of G(V) to compute the ℓ-elementary divisors of S and K.
The action of G(V) on Γ(V) commutes with A and L. Thus the vector spaces Mi(A) and Mi(L) are in fact G(V)-submodules of FℓP0. We recall that the set P0 which is the set of all singular 1-spaces in V is the vertex set of ΓV.
The action of G(V) on P0 is a rank 3 permutation action. When ℓ is not the characteteristic of the field associated with the underlying vector space V, the submodule structure of FℓP0 is given in [8], [13], [10] and [9]. We use the submodule structures present in literature to determine Mi(A) and Mi(L) and consequently find the elementary divisors of S and K.
We now define some submodules of FℓP0. These are some important submodules of FℓP0 defined in [8], [13], [10] and [9].
-
Given any subspace Z of V, we denote [Z] to be the sum of all isotropic one-
dimensional subspace of Z. We denote [V] by 1, henceforth known as the all-one vector.
-
Consider A and L to be elements of End(QℓP0). Define Vr=ker(A−rI)=ker(L−tI), and Vs=ker(A−sI)=ker(L−uI). Then define Vr to be the subspace Vr∩ZℓP0 of FℓP0, and Vs to be the subspace Vs∩ZℓP0 of FℓP0. As Vr∩ZℓP0 and Vs∩ZℓP0 are pure submodules of ZℓP0, we have dim(Vr)=dim(Vr)=f and dim(Vs)=dim(Vs)=g.
-
We define C to be the linear subspace of FℓP0 spanned by
[TABLE]
- We define C′ to be the linear subspace of FℓP0 spanned by
[TABLE]
-
We define U to be (J−Aℓ)(FℓP0), where J is the matrix of all 1′s.
-
We define U′ to be the subspace spanned by {(J−Aℓ)(v)−(J−Aℓ)(u)∣ v, u ∈P0}.
-
Let ( , ) be the symmetric bilinear form on FℓP0 with P0 as an orthonormal basis. If Z is a subspace, then Z⊥ denotes the orthogonal complement of Z with respect to ( , ).
In the following Lemma, we collect some inclusion relations involving the modules defined above, Mi(A)’s, and Mi(L)’s.
Lemma 10**.**
Let ℓ be a prime and Γ(V) be one of {Γs(q,m), Γo(q,m), Γo−(q,m), Γo+(q,m), Γuo(q,m), Γue(q,m)}* such that Aℓ or Lℓ is nilpotent. Also let q~ be the size of the field associated with V. Then the following hold.*
- (1)
We have Vs⊂Mvℓ(s)(A), Vr⊂Mvℓ(r)(A), Vs⊂Mvℓ(u)(L), and Vt⊂Mvℓ(t)(L).
2. (2)
Given α=vℓ([1z−1]q~), we have C⊂Mα(A) and C⊂Mα(L).
3. (3)
Given β=vℓ(rs), we have U⊂Mβ(A).
4. (4)
Given γ=vℓ(tu), we have U′⊂Mγ(L)
5. (5)
If ℓ∣s, then we have U⊂Mδ(L). Here δ=vℓ(ts).
Proof.
-
The eigenspace associated with an eigenvalue α of A is the same as the eigenspace associated with eigenvalue k−α of L. The proof of (1) now follows from the proof of Lemma 8.
-
Let W be a maximal totally isotropic subspace of V and let v∈P0.
As W is an isotropic subspace, if v⊂W, then v is adjacent to every
other 1-space of W, a total of [1z]q~−1.
Assume that v⊂W. Let u∈P0 and u⊂W, then v is adjacent to u if and only if u is one of the [1z−1]q~ 1-dimensional subspaces of v⊥∩W. Here v⊥ is the orthogonal complement of v with respect to the form on V.
Thus we have A([W])=[1z−1]q~1+r[W]. Since L=kI−A, we also have L([W])=−[1z−1]q~1+t[W]. Using [1z−1]q~∣t, we arrive at 2.
-
From Table 13, we observe that nilpotence of Aℓ or Lℓ implies ℓ∣q+1. Therefore we have A−1/qJ≡A+J(modℓ).
We note that im(J)=Fℓ1, and thus im(A+J)=im(J−A)=U. Using AJ=kJ, and μ=k/q and Lemma 3, we have
A(A−1/qJ−(r+s)I)=−rsI. As ℓ∣r and ℓ∣s, we can conclude 3.
-
This follows by using LJ=0, Lemma 3, and calculations similar to those above.
-
Let v∈P0 and let W be any maximal totally isotropic subspace of V. From Lemma 3, we have L(L−(t+u)I)=−tuI−μJ. From the computations above, we have L([W])=−[1z−1]q~1+t[W]. These two observations together with LJ=0 give us
[TABLE]
Lemma 2 and Lemma 3 show that [1z−1]q~μ=−s. Since ℓ∣s, we have
[TABLE]
Now (4) and (5) yield 5.
∎
8. 2-elementary divisors of S and K when Γ(V)=Γs(q,m).
Given the graph Γs(q,m) and a prime ℓ, table 13 shows that Aℓ (equivalently Lℓ) is nilpotent if and only if ℓ=2 and q is odd.
In this section we will compute the 2-elementary divisors of S and K when Γ(V)=Γs(q,m) and q is odd. We set h=1, and z=m in Lemma 3 and Lemma 2 to get the parameters for this graph. The graph Γs(q,m) is an SRG with parameters v=[12m]q, k=q[1m−1]q(1+qm−1), λ=[12m−2]q−2, and μ=[12m−2]q.
The adjacency matrix A has eigenvalues (k,r,s)=(k,qm−1−1,−(1+qm−1))
with multiplicities (1,f,g)=(1, 2(q−1)q(qm−1)(qm−1+1), 2(q−1)q(qm+1)(qm−1−1)). So the Laplacian L has eigenvalues (0,t,u)=(0,k−r,k−s)=(0,[1m−1]q(1+qm),[1m]q(1+qm−1))
with multiplicities (1,f,g).
From now on in this section, we denote Γs(q,m) by Γs.
8.1. Submodule Structure
We now recall from §7 the definitions of C, C′ U, U′, Vr and Vs in the context of the graph Γs. In this case G(V)=Sp(2m,q).
From Theorem 2.13 and Remark 2.15 of [8], we have the following result.
Theorem 11**.**
The F2Sp(2m,q) submodule structure for F2P0 is given by the following Hasse diagrams.
m is even
\textstyle{\mathbb{F}_{2}\mathbb{P}_{0}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{<\mathbf{1}>^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{C^{\prime}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{(C^{\prime})^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{C^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{<\mathbf{1}>\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\{0\}}
**
m is odd
\textstyle{\mathbb{F}_{2}\mathbb{P}_{0}}$$\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{<\mathbf{1}>^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{C^{\prime}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{(C^{\prime})^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{<\mathbf{1}>\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{C^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\{0\}}
**
We have U=(C′)⊥, U′=C⊥, dim(C)=f+1, dim(C′)=f, dim((C′)⊥)=g+1, and dim(C⊥)=g.
8.2. 2-elementary divisors when m is even
8.2.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and A2 with A.
Since m is even, [1m−1]q is odd. Thus have v2(q−1)=v2(qm−1−1)=v2(r). We set v2(q−1)=w and v2(s)=v2(1+qm−1)=d. So we have v2(k)=d=v2(μ). As ∣S∣=krfsg, we obtain v2(∣S∣)=d+wf+dg.
Lemma 10 implies that U⊂Md+w. By Theorem 11, we conclude that dim(Md+w)≥dim(U)=g+1.
As r is an eigenvalue of 2-valuation w and geometric multiplicity f, Lemma 8 implies that dim(Mw)≥f.
So by Lemma 7, setting j=2, s1=f, s2=g+1, s3=dim(ker(A))=0, t1=w, and t2=d+w, we obtain
e0=g+1, ew=f−g−1, ed+w=g+1, and ei=0 for all other i.
8.2.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and L2 with L.
In this case [1m]q is even and thus v2(qm−1)>1. This implies that v2(qm+1)=1. Set v2([1m]q)=b and v2(s)=v2(qm−1+1)=d. Then v2(t)=1, v2(u)=b+d,
v2(k)=v2(μ)=b, and v2(∣K∣)=f+(b+d)g−(b+1) (as ∣K∣=tfug/v).
Lemma 10 gives us U′⊂Mb+d+1 and U⊂Md+1. Now by Theorem 11, we can see that
dim(Mb+d+1) ≥g and dim(Md+1)≥g+1. As t is an eigenvalue of valuation 1 and geometric multiplicity f, Lemma 8 gives us dim(M1)≥f.
So by Lemma 7, setting j=3, s1=f, s2=g+1, s3=g, s4=dim(ker(L))=1, and t1=1, t2=d+1, and t3=d+b+1, we conclude that e0=g+1, e1=f−g−1, ed+1=1, eb+d+1=g−1, and ei=0 for all other i.
8.3. 2-elementary divisors when m is odd
8.3.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and A2 with A.
In this case m is odd and thus [1m−1]q is even, and therefore v2(qm−1−1)>1 and v2(qm−1+1)=1. We set v2([1m−1]q)=a and v2(q−1)=w. Now v2(r)=a+w, v2(s)=v2(qm−1+1)=1, and v2(k)=v2(μ)=a+1. As ∣S∣=krfsg, we have v2(∣S∣)=(a+w)f+g+a+1.
By Lemma 10, we have C⊂Ma and U⊂Ma+w+1. Theorem 11 implies dim(Ma)≥f+1 and dim(Ma+w+1)≥g+1.
As r is an eigenvalue of valuation a+w and geometric multiplicity f, Lemma 8 implies that dim(Ma+w)≥f.
So by Lemma 7, setting j=3, s1=f+1, s2=f, s3=g+1, s4=dim(ker(A))=0, t1=a, t2=a+w, and t3=a+w+1, we have
e0=g, ea=1, ea+w=f−g−1, ea+w+1=g+1, and ei=0 for all other i.
8.3.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and L2 with L.
As [1m−1]q is even we have v2(−1+qm−1)>1, and thus v2(s)=v2(1+qm−1)=1. Set v2(qm+1)=c and v2([1m−1]q)=a. We then have v2(t)=a+c, v2(u)=1, v2(v)=c, v2(k)=v2(μ)=a+1, and v2(∣K∣)=(a+c)f+g−c.
By Lemma 10, we have C⊂Ma and U⊂Ma+c+1. Now application of Theorem 11 gives us dim(Ma)≥f+1 and dim(Ma+c+1)≥g+1.
As t is an eigenvalue of valuation a+c and geometric multiplicity f, Lemma 8 implies that dim(Ma+c)≥f.
So by Lemma 7, setting j=3, s1=f+1, s2=f, s3=g+1, s4=dim(ker(L))=1, t1=a, t2=a+c, and t3=a+c+1, we may conclude that
e0=g, ea=1, ea+c=f−g−1, ea+c+1=g, and ei=0 for all other i.
9. 2-elementary divisors of S and K when Γ(V)=Γo(q,m).
Given the graph Γo(q,m) and a prime ℓ, table 13 shows that Aℓ (equivalently Lℓ) is nilpotent if and only if ℓ=2 and q is odd.
In this section we compute the 2-elementary divisors of S and K when Γ(V)=Γo(q,m). We set h=1, and z=m in Lemma 3 and Lemma 2 to get parameters for this graph.
The graph Γo(q,m) is an SRG with parameters v=[12m]q, k=q[1m−1]q(1+qm−1), λ=[12m−2]q−2, and μ=[12m−2]q.
The Adjacency matrix A has eigenvalues (k,r,s)=(k,qm−1−1,−(1+qm−1))
with multiplicities (1,f,g)=(1, 2(q−1)q(qm−1)(qm−1+1), 2(q−1)q(qm+1)(qm−1−1)). So the Laplacian L has eigenvalues (0,t,u)=(0,k−r,k−s)=(0,[1m−1]q(1+qm),[1m]q(1+qm−1))
with multiplicities (1,f,g).
From now on in this section, we denote Γo(q,m) by Γo.
9.1. Submodule structure
We now recall from §7 the definitions of C, C′ U, U′, Vr and Vs in the context of the graph Γo. In this case G(V)=O(2m+1,q).
From Theorem 1.1, Corollary 7.5, and Lemma 7.6 of [13], we have the following result.
Theorem 12**.**
The module U′⊥ has a submodule M containing Vs such that dim(M/Vs)=1. The relative positions of M, Vs, C, Vr, U⊥, U′, and U in the F2O(2m+1,q) submodule lattice of (U′)⊥ are given by the following diagrams.
m* is odd.*
[TABLE]
\textstyle{U^{\prime\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{r}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{M\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{s}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\left\langle\mathbf{1}\right\rangle}$$\textstyle{U^{\prime}}
m* is even.*
[TABLE]
\textstyle{U^{\prime\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{r}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{M\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{s}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\prime}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\left\langle\mathbf{1}\right\rangle}
Here y:=dim(Vs/U′)=2(q+1)(qm−1)(qm)−q, d:=dim(Vr/U)=2(q+1)(qm+1)(qm+q)−1, and x:=dim(U′)=q2−1q2m−q2, dim(C/Vr)=1, dim(M/Vs)=1, and dim(U/U′)=1.
Remark*.*
[13] proves the above for m≥3. For m=2, we refer to Theorem 3.1 of [8]. We would like to address a typographical error present in Section 3 of [8]. The definition of the submodule C of kL2 should be changed from ⟨M ∣M∈L2⟩k to ⟨η1,2(M) ∣M∈L1⟩k, and the related definition of C+ should be similarly corrected.
9.2. 2-elementary divisors when m is even
9.2.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and A2 with A.
Since [1m−1]q is odd, we have v2(q−1)=v2(qm−1−1). Setting v2(q−1)=w, v2(1+qm−1)=d, we have v2(k)=d=v2(μ), v2(r)=w, v2(s)=d, and v2(∣S∣)=d+dg+wf.
Case 1: Assume that w=1.
In this case, as v2(qm−1−1)=w=1, we have d=v2(qm−1+1)=v2(qm−1−1+2)>1.
As r,s are integer eigenvalues with non-zero 2-valuations, Lemma 10 gives us Vr⊂M1 and Vs⊂M1. Now by Theorem 12, we have Vr+Vs=U⊥⊂M1 and hence
dim(M1)≥dim(U⊥)=f+g+1−dim(U)=f+g−x.
By Lemma 10, U⊂Md+1. By Theorem 12 we have dimU=x+1, and thus
dim(Md+1)≥x+1.
Now s is an integer eigenvalue of geometric multiplicity g and 2-valuation d. Lemma 10 gives us Vs⊂Md. Also U⊂Md+1⊂Md. So by Theorem 12, we have Vs+U=M⊂Md and hence dim(Md)≥dim(M)=g+1.
We have,
[TABLE]
So by Lemma 7, setting j=3, s1=f+g−x, s2=g+1, s3=x+1, s4=dim(ker(A))=0, t1=1, t2=d, and t3=d+1, we may conclude that
e0=x+1, e1=f−x−1, ed=g−x, ed+1=x+1, and ei=0 for all other i>0.
Case 2: Assume that w>1.
In this case, d=1.
As r,s are integer eigenvalues with non-zero 2-valuations, we have by Lemma 10, Vr⊂M1 and Vs⊂M1. Thus by Theorem 12, U⊥⊂M1. Hence dim(M1)≥f+g+1−x−1.
By Lemma 10, we have U⊂Mw+1. Thus dim(Mw+1)≥x+1 and. We have
[TABLE]
So by Lemma 7, setting j=3, s1=f+g−x, s2=f, s3=x+1, s4=dim(ker(A))=0, t1=1, t2=w, and t3=w+1, we may conclude that
e0=x+1, e1=g−x, ew=f−x−1, ew+1=x+1, and ei=0 for all other i>0.
9.2.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and L2 with L.
In this case, m is even. Since [1m]q is even, we have v2(qm−1)>1 and v2(qm+1)=1. We set v2([1m]q)=b and v2(s)=v2(qm−1+1)=d. So we have v2(t)=1, v2(u)=d+b,
v2(k)=v2(μ)=d, and v2(∣K∣)=f+(b+d)g−(b+1).
As A≡L(mod2), from Smith group computation above we conclude that dim(M1)≥f+g−x.
As u is an eigenvalue of valuation d+b, Lemma 10 implies Vs⊂Md+b, and thus dim(Md+b)≥g.
By Lemma 10, we have U′⊂Md+b+1 and U⊂Md+1. Therefore dim(Md+b+1)≥x, by Theorem 12.
Since Vs⊂Md+b⊂Md+1 and U⊂Md+1, by Theorem 12 we have Md+1⊂M. We may now conclude that dim(Md+1)≥g+1.
Now,
[TABLE]
We apply Lemma 7 to conclude the following.
If b>1, set j=4, s1=f+g−x, s2=g+1, s3=g, s4=x s5=dim(ker(L))=1, t1=1, t2=d+1, t3=d+b, t4=d+b+1, then by Lemma 7, we have
e0=x+1, e1=f−x−1, ed+1=1, ed+b=g−x, ed+b+1=x−1, and ei=0 for all other i.
If b=1, set j=3, s1=f+g−x, s2=g+1, s3=x, s4=dim(ker(L))=1, t1=1, t2=d+1, t3=d+b+1, then by Lemma 7, we have
e0=x+1, e1=f−x−1, e1+d=g+1−x, ed+b+1=x−1, and ei=0 for all other i.
9.3. 2-elementary divisors of S and K, when m is odd.
9.3.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and A2 with A.
In this case m is odd.
As m is odd, [1m−1]q is even and thus v2([1m−1]q)>0. Set v2([1m−1]q)=a and v2(q−1)=w. So we have v2(r)=a+w, v2(s)=1, v2(k)=v2(μ)=a+1, and v2(∣S∣)=(a+w)f+g+(a+1).
By Lemma 10, dim(Ma)≥f+1 (since dim(C)=f+1 by Theorem 12).
As s is an integer eigenvalue of multiplicity g with 2-valuation 1, Lemma 10 implies Vs⊂M1. Since C⊂Ma⊂M1 aswell , Theorem 12 implies M1⊃Vs+C=(U′)⊥. So dim(M1)≥dim(U′⊥)=f+g+1−dim(U′)=f+g+1−x.
As r is an integer eigenvalue of multiplicity f with 2-valuation a+w, Lemma 10 implies dim(Ma+w)≥f.
By Lemma 10, we also have U⊂Ma+w+1. From Theorem 12, we conclude dim(Ma+w+1)≥x+1.
We have
[TABLE]
We may conclude the following from Lemma 7.
If a>1, setting j=4, s1=f+g+1−x, s2=f+1, s3=f, s4=x+1, s5=dim(ker(A))=0, t1=1, t2=a, t3=a+w, and t4=a+w+1, by Lemma 7 we get e0=x, e1=g−x, ea=1, ea+w=f−x−1, ea+w+1=x+1 and ei=0 for all other i>0.
If a=1, setting j=3, s1=f+g+1−x, s2=f, s3=x+1, s4=dim(ker(A))=0, t1=1, t2=a+w, and t3=a+w+1, by Lemma 7, e0=x, e1=g+1−x, ea+w=f−x−1, ea+w+1=x+1, and ei=0 for all other i>0.
9.3.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and L2 with L.
In this case, m is odd.
As [1m−1]q is even, we have v2(−1+qm−1)>1 and thus v2(s)=v2(1+qm−1)=1. Set v2(qm+1)=c and v2([1m−1]q)=a. We have v2(t)=a+c, v2(u)=1, v2(v)=c, v2(k)=v2(μ)=a+1, and v2(∣K∣)=(a+c)f+g−c.
By Lemma 10, C⊂Ma and U⊂Ma+c+1. Thus we have dim(Ma)≥f+1 and dim(Ma+c+1)≥x+1, by Theorem 12.
As u is an integer eigenvalue of geometric multiplicity g with 2-valuation 1, Lemma 8 implies M1⊃Vs. Since C⊂Ma⊂M1, Theorem 12 implies M1⊃(U′)⊥. Thus dim(M1)≥f+g+1−x.
As t is an integer eigenvalue of multiplicity g with 2-valuation a+b, Lemma 10 implies Ma+c⊃Vr. So dim(Ma+c)≥f.
We have
[TABLE]
Using Lemma 7, we conclude the following.
If a>1, setting j=4, s1=f+g+1−x, s2=f+1, s3=f, s4=x+1, s5=dim(ker(L))=1, t1=1, t2=1, t3=a+c, and t4=a+c+1, by Lemma 7 we have e0=x, e1=g−x, ea=1, ea+c=f−x−1, ea+c+1=x, and ei=0 for all other i.
If a=1, by similar arguments we can deduce that e0=x, e1=g−x+1, ea+c=f−x−1, ea+c+1=x, and ei=0 for all other i.
10. ℓ-elementary divisors of S and K when Γ(V)=Γo−(q,m), and ℓ∣q+1.
Given the graph Γo−(q,m) and a prime ℓ, table 13 shows that Aℓ is nilpotent if and only if either i) ℓ=2 and q is odd; or ii) ℓ is odd with ℓ∣q+1 and m is even. We also have Lℓ is nilpotent if and only if ℓ∣q+1.
In this section we compute the ℓ-elementary divisors of S and K when Γ(V)=Γo−(q,m) and (ℓ,q,m) satisfy the arithmetic conditions given above.
From now on in this section, we denote Γo−(q,m) by Γo−, and ℓ is a prime that meets the description in the previous paragraph.
We set h=2 and z=m−1 in Lemma 3 and Lemma 2 to get the parameters for this graph. Thus we get that Γo−(V) is an SRG with parameters
v=[1m−1]q(qm+1), k=q[1m−2]q(qm−1+1),
λ=q[1m−2]q(qm−1+1)−1−q2m−3, and
μ=[1m−2]q(qm−1+1).
The eigenvalues of the adjacency matrix A are (k,r,s)=(k,qm−2−1,−(1+qm−1)),
with multiplicities (1,f,g)=(1, (q2−1)q2(qm−1−1)(qm−1+1), (q2−1)q(qm+1)(qm−2−1)).
So the Laplacian L has eigenvalues (0,t,u)=(0,[1m−2]q(1+qm),[1m−1]q(1+qm−1))
with multiplicities (1,f,g).
10.1. Submodule structure
We now recall from §7 the definitions of C, C′ U, U′, Vr and Vs in the context of the graph Γo−. In this case G(V)=O−(2m,q).
By Corollary 8.5, Lemma 8.7, Lemma 8.8, Lemma 8.9, Corollary 8.10, and Corollary 8.11 of [13], we have the following result.
Theorem 13**.**
Given a prime ℓ with ℓ∣q+1.
The relative positions of C, Vr, Vs, U′, U, and ⟨1⟩ in the FℓO−(2m,q) submodule structure of C are in the following diagrams. We have dim(C)=f+1.
ℓ=2* and m is even*
\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{r}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\left\langle\mathbf{1}\right\rangle}$$\textstyle{U^{\prime}=\overline{V}_{s}}
ℓ=2* and m is odd*
\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{r}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\prime}=\overline{V}_{s}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\left\langle\mathbf{1}\right\rangle}
ℓ=2, ℓ∣q+1, and m is even.
\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{r}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\left\langle\mathbf{1}\right\rangle}$$\textstyle{U^{\prime}=\overline{V}_{s}}
ℓ=2, ℓ∣q+1, and m is odd.
\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{r}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\prime}=\overline{V}_{s}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\left\langle\mathbf{1}\right\rangle}
10.2. 2-elementary divisors of S and K when m is odd.
10.2.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and A2 with A.
Since m is odd, [1m−2]q is an odd number. So we have
v2(r)=v2(qm−2−1)=v2(q−1). As [1m−1]q is an even number, v2(qm−1−1)>1, and thus v2(qm−1+1)=1=v2(s). We also have v2(k)=v2(μ)=1. Setting v2(q−1)=w, we have v2(r)=w and v2(∣S∣)=wf+g+1.
By Lemma 10, we have U⊂Mw+1. So by Theorem 13, we get dim(Mw+1)≥g+1.
Since r is an integer eigenvalue with valuation w, Lemma 8 implies dim(Mw)≥f.
Now we have (w)(f−(g+1))+(w+1)(g+1)=wf+g+1=v2(∣S∣). So by Lemma 7, setting j=2, t1=w, t2=w+1, s1=f, s2=g+1, s3=dim(ker(A))=0, we conclude that e0=g+1, ew=f−g−1, ew+1=g+1, and ei=0 for all other i.
10.2.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and L2 with L.
Set v2(qm+1)=c and v2([1m−1]q)=b. Since m is odd, we have v2(s)=v2(qm−1+1)=1. So v2(t)=c, v2(u)=b+1, v2(v)=c+b, v2(μ)=1, and v2(∣K∣)=cf+(b+1)g−(c+b).
As t is an eigenvalue of valuation f, by Lemma 8, we have
dim(Mc)≥f.
Lemma 10 implies that U⊂Mc+1 and U′⊂Mb+c+1. Therefore dim(Mb+c+1)≥g and dim(Mc+1)≥g+1, by Theorem 13.
Now, c(f−(g+1))+(c+1)(g+1−g)+(b+c+1)(g−1)=cf+(b+1)g−b−c.
So by Lemma 7, setting j=3, s1=f, s2=g+1, s3=g, s4=dim(ker(L))=1, t1=c, t2=c+1, and t3=b+c+1, we may conclude that
e0=g+1, ec=f−g−1, ec+1=1, eb+c+1=g−1 and ei=0 for all other i.
10.3. 2-elementary divisors of S and K when m is even.
10.3.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and A2 with A.
As m is even, [1m−2]q is even and [1m−1]q is odd. Set v2([1m−2]q)=a, v2(qm−1−1)=v2(q−1)=w and v2(qm−1+1)=d. Then v2(r)=a+w, v2(s)=d, v2(k)=v2(μ)=a+d, and v2(∣S∣)=(a+w)f+dg+a+d.
Lemma 10, implies that C⊂Ma. Thus by Theorem 13 we have dim(Ma)≥f+1.
As r is an eigenvalue of valuation a+w, Lemma 8 implies dim(Ma+w)≥f.
By Lemma 10, U⊂Ma+d+w. Thus by Theorem 13, dim(Ma+d+w)≥g+1.
We have a(f+1−f)+(a+w)(f−(g+1))+(a+d+w)(g+1)=(a+w)f+dg+a+d.
So by Lemma 7, setting j=3, s1=f+1, s2=f, s3=g+1, s4=dim(ker(A))=0, t1=a, t2=a+w, and t3=a+d+w, we have e0=g, ea=1,ea+w=f−g−1,ea+d+w=g+1 and ei=0 for all other i.
10.3.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and L2 with L.
As m is even, [1m−2]q is even and [1m−1]q is odd.
Set v2([1m−2]q)=a and v2(s)=v2(qm−1+1)=d. As [1m]q is even, we have v2(qm−1)>1 and v2(qm+1)=1. Since [1m−1]q is odd, we have v2(v)=1. We have v2(t)=a+1, v2(u)=d, and v2(μ)=a+d, and v2(∣K∣)=(a+1)f+dg−1.
By Lemma 10, we have C⊂Ma and U⊂Ma+d+1. Therefore by Theorem 13, we have dim(Ma)≥f+1 and dim(Ma+d+1)≥g+1.
As t is an integer eigenvalue of L with valuation a+1, Lemma 8 implies dim(Ma+1)≥f.
We have a(f+1−f)+(a+1)(f−(g+1))+(a+d+1)(g+1−1)=(a+1)f+dg−1=v2(∣K∣).
Therefore by Lemma 7, setting j=3, s1=f+1, s2=f, s3=g+1, s4=dim(ker(L))=1, t1=a, t2=a+1, and t3=a+d+1,
we have e0=g, ea=1, ea+1=f−g−1, ea+d+1=g, and ei=0 for all other i=0.
10.4. ℓ-elementary divisors of S and K when m is even, ℓ=2 and ℓ∣q+1.
10.4.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and Aℓ with A.
In this case ℓ is an odd prime dividing q+1 and m is even. Thus vℓ([1m−2]q)=v2(r).
Set
vℓ([1m−2]q)=a and vℓ(s)=vℓ(qm−1+1)=d. Then vp(r)=a, vℓ(k)=a+d=vℓ(μ), and vℓ(∣S∣)=af+dg+a+d.
By Lemma 10, we have C⊂Ma and U⊂Ma+d. Thus dim(Ma)≥f+1 and dim(Ma+d)≥g+1, by Theorem 13.
We have a(f+1−(g+1))+(a+d)(g+1)=vℓ(∣S∣).
So by Lemma 7, setting j=2, s1=f+1, s2=g+1, s3=dim(ker(A))=0, t1=a, t2=a+d, we conclude e0=g ea=f−g, ea+d=g+1, and ei=0 for all other i.
10.4.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and Lℓ with L.
In this case ℓ is an odd prime with m even. We set
vℓ([1m−2]q)=a, and vℓ(qm−1+1)=d. As q≡−1(modℓ), we have vℓ(v)=vℓ(([1m−1]q(qm+1)))=0. Thus vℓ(t)=a, vℓ(u)=d, and vℓ(∣K∣)=af+dg.
Lemma 10 gives us C⊂Ma and U⊂Ma+d. Now Theorem 13 gives us dim(Ma)≥f+1 and dim(Ma+d)≥g+1.
We have a(f+1−(g+1))+(a+d)(g+1−1)=af+dg=.
So by Lemma 7, setting j=2, s1=f+1, s2=g+1, s3=dim(ker(A))=1, t1=a, t2=a+d, we have e0=g, ea=f−g, ea+d=g, and ei=0 for all other i=0.
10.5. ℓ-elementary divisors of K when m is odd, ℓ=2 and ℓ∣q+1.
In this case we have q≡−1(modℓ) and thus r≡s≡−2(modℓ) and thus ℓ∤∣S∣. However we see that ℓ∣t and ℓ∣u and thus ℓ∣∣K∣. In this section we compute the ℓ-elementary divisors of K.
10.5.0.1 Elementary divisors of K.
We identify Mi(L) with Mi and Lℓ with L.
Set vℓ(qm+1)=c and vℓ([1m−1]q)=b. Since m is odd, we have vℓ(s)=vℓ(qm−1+1)=0. So vℓ(t)=c, vℓ(u)=b, vℓ(v)=c+b, vℓ(μ)=0, and vℓ(∣K∣)=cf+bg−(c+b).
Lemma 10 gives us U′⊂Mb+c and Vr⊂Mc. Therefore dim(Mb+c)≥g and dim(Mc)≥f, by Theorem 13.
Now we have vℓ(∣K∣)=cf+bg−c−b=c(f−g)+(b+c)(g−1).
So by Lemma 7, setting j=2, s1=f, s2=g+1, s3=dim(ker(L))=1, t1=c, t2=b+c, we may conclude that
e0=g+1, ec=f−g, eb+c=g−1, and ei=0 for all other i.
11. ℓ-elementary divisors of S and K when Γ(V)=Γo+(q,m), and ℓ∣q+1
Given the graph Γo+(q,m) and a prime ℓ, table 13 shows that Aℓ is nilpotent if and only if either i) ℓ=2 and q is odd; ii) or ℓ is odd with ℓ∣q+1 and m is odd.
Also Lℓ is nilpotent if and only if ℓ∣q+1
In this section we compute the ℓ-elementary divisors of S and K when Γ(V)=Γo+(q,m) and (ℓ,q,m) satisfy the arithmetic conditions given above.
From now on in this section, we denote Γo+(q,m) by Γo+, and ℓ is a prime that meets the description in the previous paragraph. We set h=0, and z=m in Lemma 3 and Lemma 2 to get parameters for this graph. Thus Γo+(V) is an SRG with parameters v=[1m]q(qm−1+1), k=q[1m−1]q(qm−2+1), λ=q[1m−1]q(qm−2+1)−1−q2m−3, and μ=[1m−1]q(qm−2+1).
So the eigenvalues of the adjacency matrix A are (k,r,s)=(k,qm−1−1,−(1+qm−2)),
with multiplicities (1,f,g)=(1, (q2−1)q(qm−1)(qm−2+1), (q2−1)q2(qm−1+1)(qm−1−1)).
So L has eigenvalues (0,t,u)=(0,k−r,k−s)=(0,[1m−1]q(1+qm−1),[1m]q(1+qm−2))
with multiplicities (1,f,g).
11.1. Submodule Structure.
We now recall from §7 the definitions of C, C′ U, U′, Vr and Vs in the context of the graph Γo+. In this case G(V)=O+(2m,q).
By Corollary 2.10, 6.5, Lemma 6.6 of [13] we have the following result.
Theorem 14**.**
Let ℓ be a prime with ℓ∣q+1.
Then the relative positions of U⊥, C, Vs, Vr, U, U′, and ⟨1⟩ in the FℓO+(2m,q) submodule structure of (U′)⊥ are given in the following diagrams. We have dim((U′)⊥)=g+2.
ℓ=2* and m is even*
[TABLE]
\textstyle{(U^{\prime})^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U=\overline{V}_{r}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{s}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\prime}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\left\langle\mathbf{1}\right\rangle}
ℓ=2* and m is odd*
\textstyle{(U^{\prime})^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U=\overline{V}_{r}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{s}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\left\langle\mathbf{1}\right\rangle}$$\textstyle{U^{\prime}}
ℓ=2, m is odd and ℓ∣q+1
\textstyle{(U^{\prime})^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{s}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{r}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\left\langle\mathbf{1}\right\rangle}$$\textstyle{U^{\prime}}
ℓ=2, m is odd and ℓ∣q+1
[TABLE]
\textstyle{(U^{\prime})^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{s}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{r}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\prime}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\left\langle\mathbf{1}\right\rangle}
Here, dim(U′)=f−1, dim(U)=f, dim(C)=f+1, dim(U⊥)=f+g+1−dim(U)=g+1.
11.2. 2-elementary divisors of S and K when m is even.
11.2.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and A2 with A.
In this case m is even. Therefore [1m−1]q is odd. So we have v2(r)=v2(qm−1−1)=v2(q−1), v2(s)=v2(qm−2+1)=1, and v2(k)=v2(μ)=1. Setting v2(q−1)=w, we have v2(∣S∣)=wf+g+1.
Lemma 8 implies Vr⊂M1 and Vs⊂M1. Thus by Theorem 14, we see that M1⊃U⊥, and hence dim(M1)≥g+1.
Lemma 10 gives us U⊂Mw+1. Thus by Theorem 14, we get dim(Mw+1)≥f.
We have 1(g+1−f)+(w+1)f=v2(∣S∣).
So by Lemma 7, setting j=2, s1=g+1, s2=f, s3=dim(ker(A))=0, t1=1, and t2=w+1, we conclude e0=f, e1=g+1−f, ew+1=f, and ei=0 for all i.
11.2.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and L2 with L.
In this case m is even, so we have
v2(s)=v2(qm−2+1)=1 and v2(k)=v2(μ)=1. Set v2(qm−1+1)=c and v2([1m]q)=b. We now have v2(t)=c, v2(u)=b+1, v2(v)=c+b, and v2(∣K∣)=cf+(b+1)g−b−c.
Lemma 10 gives us U′⊂Mb+c+1, U⊂Mc+1, and Vs⊂Mb+1.
We use Lemma 7 to conclude the following.
- (1)
If c<b, we have Mc+1⊃Mb+1 and thus Vs⊂Mc+1. Also since U⊂Mc+1, Theorem 14 implies U⊥⊂Mc+1. Hence dim(Mc+1)≥g+1.
Again by Theorem 14 dim(Mb+1)≥dim(Vs)≥g, and dim(Mb+c+1)≥dim(U′)≥f−1.
So (c+1)(g+1−g)+(b+1)(g−(f−1))+(b+c+1)(f−1−1)=v2(∣K∣).
Now by Lemma 7, setting j=3, s1=g+1, s2=g, s3=f−1, s4=dim(ker(L))=1, t1=c+1, t2=b+1, and t3=b+c+1, we have e0=f, ec+1=1, eb+1=g−f+1, eb+c+1=f−2, and ei=0 for all other i.
2. (2)
If c>b, By arguments similar to those above we can show dim(Mb+1)≥g+1. We also have dim(Mc+1)≥f, and dim(Mb+c+1)≥f−1.
So
(b+1)(g+1−f)+(c+1)(f−(f−1))+(b+c+1)(f−1−1)=v2(∣K∣). Applying Lemma 7 as above, we get e0=f, ec+1=1, eb+1=g−f+1, eb+c+1=f−2, and ei=0 for all other i=0.
3. (3)
If b=c, by similar arguments, we can show e0=f, ec+1=g−f+2, e2c+1=f−2, and ei=0 for all other i.
11.3. 2-elementary divisors of S and K when m is odd.
11.3.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and A2 with A.
As m is odd, we have v2(qm−1+1)=1 and v2([1m−1]q)>1.
We set v2([1m−1]q)=a, v2(q−1)=w and v2(qm−2+1)=d. So v2(r)=a+w, v2(s)=d, v2(k)=v2(μ)=a+d, and v2(∣S∣)=(a+w)f+dg+a+d.
By Lemma 10, we have C⊂Ma, U⊂Ma+w+d, and
Vs⊂Md. Using Lemma 7 we arrive at the following conclusions.
- (1)
Assume that d<a, then Md⊃Ma⊃C. Now since Vs and C are subsets of Md,Theorem 14 gives us (U)′⊥⊂Md, and thus dim(Md)≥g+2. Since C⊂Ma, we have dim(Ma)≥f+1. Again by Theorem 14 we get dim(Ma+w+d)≥f=dim(U).
Now,
d(g+2−(f+1))+a(f+1−f)+(a+w+d)(f)=v2(∣S∣).
So by Lemma 7, setting j=3, s1=g+2, s2=f+1, s3=f, s4=dim(ker(A)), t1=d, t2=a, and t3=a+w+d, we have
e0=f−1, ed=g−f+1, ea=1, ea+w+d=f, and ei=0 for all other i.
2. (2)
If a<d, by arguments similar to the ones above, we can show dim(Ma)≥g+2. As U⊂Ma+w+d⊂Md and Vs⊂Md, Theorem 14 implies dim(Md)≥g+1, and dim(Ma+w+d)≥f.
Now,
a(g+2−(g+1))+d(g+1−f)+(a+w+d)(f)=v2(∣S∣).
Applying Lemma 7 as above, we have
e0=f−1, ed=g−f+1, ea=1, ea+w+d=f, and ei=0 for all other i.
3. (3)
If a=d, by similar arguments we can show that e0=f−1, ea=g+2−f, ea+d+w=f, and ei=0 for all other i.
11.3.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and L2 with L.
As m is odd, we have v2(qm−1+1)=1 and v2([1m−1]q)>1. Set v2([1m−1]q)=a and v2(s)=v2(qm−2+1)=d. So v2(t)=a+1, v2(u)=d, v2(v)=1, and v2(∣K∣)=(a+1)f+dg−1.
By Lemma 10, we have C⊂Ma and U⊂Ma+d+1.
Again by Lemma 10 we have Vs⊂Md.
Using Lemma 7 we arrive at the following conclusions.
- (1)
Assume d<a, then C⊂Ma⊂Md. As Vs⊂Md, Theorem 14 implies (U′)⊥⊂Md, and hence dim(Md)≥dim(U′⊥)=g+2. Also dim(Ma)≥dim(C)=f+1, and dim(Ma+d+1)≥dim(U)=f.
Now,
d(g+2−(f+1))+a(f+1−f)+(a+d+1)(f−1)=dg+(a+1)f−a−1=v2(∣K∣).
So by Lemma 7, setting j=3, s1=g+2, s2=g+1, s3=f, s4=dim(ker(L))=1, t1=a, t2=d, and t3=a+d+1, we have
e0=f−1, ea=1, ed=g+1−f, ea+d+1=f−1, and ei=0 for all i.
2. (2)
If a<d, by arguments similar to those above, dim(Ma)≥g+2. As 1∈Md, and Vs⊂Md, by Theorem 14, it follows that dim(Md)≥g+1. We also have dim(Ma+d+1)≥f.
Now,
a(g+2−(g+1))+d(g+1−f)+(a+d+1)(f−1)=dg+(a+1)f−a−1=v2(∣K∣).
By applying Lemma 7 as above, we have e0=f−1, ea=1, ed=g+1−f, ea+d+1=f−1, and ei=0 for all other i.
3. (3)
If a=d, by arguments similar to those above we may show that e0=f−1, ea=g+2−f, e2a+1=f−1, and ei=0 for all other i.
11.4. ℓ-elementary divisors of S and K when m is odd, and ℓ∣q+1.
11.4.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and Aℓ with A.
In this case ℓ∣q+1 is an odd prime with m odd. So we have vℓ([1m−1]q)=vℓ(r). We set
vℓ([1m−1]q)=vℓ(r)=a, and vℓ(s)=vℓ(qm−2+1)=d. Then vℓ(k)=a+d=vℓ(μ) and vℓ(∣S∣)=af+dg+a+d.
By Lemma 10, we have U⊂Ma+d, Vs⊂Md, and Vr⊂Ma. We now apply Theorem 14 and Lemma 7 to conclude the following.
- (1)
Assume a<d, then Vs⊂Ma⊂Md. Since
Vr⊂Ma, Theorem 14 implies dim(Ma)≥dim(U⊥)=g+1. As U⊂Ma+d⊂Ma, Theorem 14 implies dim(Ma)≥dim(U⊥)≥g+1. From above, we have dim(Ma+d)≥dim(U)=f.
Now,
a(g+2−(g+1))+d(g+1−f)+(a+d)f=vℓ(∣S∣).
By Lemma 7, setting j=3, s1=g+2, s2=g+1, s3=f, s4=dim(ker(A))=1, t1=a, t2=d, and t3=a+d, we have
e0=f−1, ea=1, ed=g−f+1, ea+d=f, and ei=0 for all other i.
2. (2)
If d<a, by arguments similar to those above, we can show that dim(Md)≥g+1. Since U⊂Ma+d⊂Ma and Vr⊂Ma, Theorem 14 implies dim(Ma)≥dim(C)≥f+1. From above, we have dim(Ma+d)≥dim(U)=f.
Now,
b(g+2−(f+1))+d(f+1−f)+(a+d)f=vℓ(∣S∣).
By applying Lemma 7, we get e0=f−1, ea=1, ed=g−f+1, ea+d=f, and ei=0 for all other i.
3. (3)
If a=d, by arguments similar to those above, we get e0=f−1, ea=g−f+2, ea+d=f, and ei=0 for all other i.
11.4.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and Lℓ with L.
In this case ℓ∣q+1 is an odd prime with m odd, we have vℓ([1m−1]q)>0, vℓ(qm−1+1)=0, and vℓ([1m]q)=0. Setting vℓ([1m−1]q)=a v2(s)=vℓ(qm−2+1)=d, we have vℓ(t)=a, vℓ(u)=c, vℓ(v)=0, and vℓ(∣K∣)=af+dg.
As L≡−A(mod2a+d), we have Mi(L)=Mi(A) for all i≤a+c. So we have U⊂Ma+d, Vs⊂Md, and Vr⊂Ma
Using this fact and Lemma 7 we conclude the following.
- (1)
If a<d, then Ma⊃Md⊃Vs. Since Ma⊃Vr as well, by Theorem 14 we have dim(Ma)≥g+2, dim(Md)≥g+1, and dim(Ma+d)≥f.
Now
a(g+2−(g+1))+d(g+1−f)+(a+b)(f−1)=vℓ(∣K∣).
So by Lemma 7, setting j=3, s1=g+2, s2=g+1, s3=f, s4=dim(ker(L))=1, t1=a, t2=d, and t3=a+d, we have e0=f−1, ea=1, ed=g−f+1, and ea+d=f−1, and ei=0 for all other i.
2. (2)
If a>d, we have Md⊃Ma. So by similar arguments dim(Md)≥g+2. And by the above we have dim(Ma)≥g+1, and dim(Ma+d)≥f.
Now
a(g+2−(f+1))+d(f+1−f)+(a+d)(f−1)=vℓ(∣K∣). By Lemma 7, we have e0=f−1, ea=1, ed=g−f+1, and ea+d=f−1, and ei=0 for all other i.
3. (3)
If a=d, by arguments similar to those above, we have e0=f−1, ea=g−f+2, e2a=f−1, and ei=0 for all other i.
11.5. ℓ-elementary divisors of K when m is even and ℓ∣q+1.
In this case we have q≡−1(modℓ) and thus r≡s≡−2(modℓ) and thus ℓ∤∣S∣. However we see that ℓ∣t and ℓ∣u and thus ℓ∣∣K∣. In this section we compute the ℓ-elementary divisors of K.
11.5.0.1 Elementary divisors of K.
We identify Mi(L) with Mi and Lℓ with L.
Set vℓ(qm−1+1)=c and vℓ([1m]q)=b. Since m is odd, we have vℓ(s)=vℓ(qm−2+1)=0. So vℓ(t)=c, vℓ(u)=b, vℓ(v)=c+b, vℓ(μ)=0, and vℓ(∣K∣)=cf+bg−(c+b).
Lemma 10 gives us
Vr⊂Mc, Vs⊂Mb and U′⊂Mb+c. We now use Lemma 7 to conclude the following.
- (1)
If c<b, we have Mc⊃Mb and thus Vs⊂Mc. Also since Vr⊂Mc, Theorem 14 implies U⊥⊂Mc. Hence dim(Mc)≥g+1.
Again by Theorem 14 dim(Mb)≥dim(Vs)≥g, and dim(Mb+c)≥dim(U′)≥f−1.
So (c)(g+1−g)+(b)(g−(f−1))+(b+c)(f−1−1)=v2(∣K∣).
Now by Lemma 7, setting j=3, s1=g+1, s2=g, s3=f−1, s4=dim(ker(L))=1, t1=c, t2=b, and t3=b+c, we have e0=f, ec=1, eb=g−f+1, eb+c=f−2, and ei=0 for all other i.
2. (2)
If c>b, By arguments similar to those above we can show dim(Mb)≥g+1. We also have dim(Mc)≥f, and dim(Mb+c)≥f−1.
So
(b)(g+1−f)+(c)(f−(f−1))+(b+c)(f−1−1)=v2(∣K∣). Applying Lemma 7 as above, we get e0=f, ec=1, eb=g−f+1, eb+c=f−2, and ei=0 for all other i=0.
3. (3)
If b=c, by similar arguments, we can show e0=f, ec=g−f+2, e2c=f−2, and ei=0 for all other i.
12. ℓ-elementary divisors of S and K when Γ(V)=Γue(q,m), and ℓ∣q+1.
Given the graph Γue(q,m) and a prime ℓ, table 13 shows that Aℓ (equivalently Lℓ) is nilpotent if and only if ℓ∣q+1. In this section we compute the ℓ-elementary divisors of S and K when Γ(V)=Γue(q,m) and ℓ∣q+1.
We set h=21, and z=m in Lemma 3 and Lemma 2 to get parameters for this graph. Thus Γue(q,m) is an SRG with parameters
v=[1m]q2(q2m−1+1), k=q2[1m−1]q2(q2m−3+1) , λ=(q2−1)+q4((q)2m−5+1)[1m−2]q2 , and μ=[1m−1]q2(q2m−3+1).
The adjacency matrix A has eigenvalues (k,r,s)=(k,q2m−2−1,−(1+q2m−3)),
with multiplicities (1,f,g)=(1,q+1q2[1m]q2(q2m−3+1),q−1q3[1m−1]q2(q2m−1+1)).
So L has eigenvalues (0,t,u)=(0,[1m−1]q2(1+q2m−1),[1m]q2(1+q2m−3))
with multiplicities (1,f,g).
12.1. Submodule Structure
We now recall from §7 the definitions of C, C′ U, U′, Vr and Vs in the context of the graph Γue. In this case G(V)=U(2m,q2).
By Corollary 2.10, Corollary 4.5, and Lemma 4.6 of [13], we have the following result.
Theorem 15**.**
*When ℓ∣q+1, the module U′⊥ has a submodule M containing Vs such that dim(M/Vs)=1.
The relative positions of M,U⊥, C, Vs, Vr, U, U′, and ⟨1⟩ in the FℓU(2m,q2) submodule structure of (U′)⊥ are given in the following diagrams.
ℓ∤m
\textstyle{(U^{\prime})^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{M\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{r}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{s}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\left\langle\mathbf{1}\right\rangle}$$\textstyle{U^{\prime}}
ℓ∣m
\textstyle{U^{\prime\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\perp}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{C\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{M\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{r}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\overline{V}_{s}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{U^{\prime}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}$$\textstyle{\left\langle\mathbf{1}\right\rangle}
Here δ:=dim(Vr/U)=q+1q2m−1, y:=dim(Vs/U′)=(q+1)2(q2m−1)(q2m−1−q), x:=dim(U′)=(q2−1)(q−1)(q2m−1)(q2m−1+1), and dim(M/Vs)=dim(U/U′)=dim(C/Vr)=1.
12.2. ℓ-elementary divisors of S and K when ℓ∣q+1 and ℓ∤m.
12.2.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and Aℓ with A.
In this case, ℓ∣q+1 and ℓ∤m.
Set vℓ(q2−1)=w, vℓ([1m−1]q2)=a, and vℓ(q2m−3+1)=d. Then vℓ(r)=w+a, vℓ(s)=d, vℓ(k)=vℓ(μ)=a+d, and vℓ(∣S∣)=(w+a)f+dg+a+d.
Now s is an eigenvalue of valuation d and k is an eigenvalue of valuation a+d.
So Lemma 8 implies Vs⊂Md and ⟨1⟩⊂Ma+d⊂Md. So by Theorem 15, we have Md⊃Vs⊕⟨1⟩.
Lemma 10 implies C⊂Ma, U⊂Mw+a+d, and Vr⊂Mw+a.
For any positive integer n, we have q2n+1+1=(q+1)([12n+1]−q). Therefore if ℓ∣q+1, the following are true.
-
vℓ(q2n+1+1)=vℓ(q+1) if and only if ℓ∣2n+1.
-
vℓ([1m−1]q2)=0 if and only if ℓ∣m−1.
-
vℓ(q2−1)=vℓ(q+1) if and only if ℓ=2.
Subcase 1:When ℓ∤m−1.
In this case, a=0, since vℓ([1m−1]q2)=0. We have vℓ(∣S∣)=wf+dg+d. We apply Lemma 7 and Theorem 15 to arrive at the following results.
- (1)
Assume w<d, then we have as Md⊃Vs⊕⟨1⟩, and Vr⊂Md⊂Mw⊃Vr. So by Theorem 15, U⊥=Vr+Vs⊃Mw. We saw that Mw+d⊃U.
Again by Theorem 15, we have dim(Mw)≥dim(U⊥)=f+g+1−dim(U)=f+g−x, dim(Md)≥g+1, and dim(Mw+d)≥dim(U)=x+1.
Now a(f+g−x−(g+1))+d((g+1)−(x+1))+(w+d)(x+1)=wf+dg+d=vℓ(∣S∣).
So by Lemma 7, setting j=3, s1=f+g−x, s2=g+1, s3=x+1, s4=dim(ker(A))=0, t1=w, t2=d, and t3=w+d, we have e0=x+1, ew=f−x−1, ed=g−x, ew+d=x+1, and ei=0 for all other i.
2. (2)
If w>d, by arguments similar to those above we can show that Md⊃U⊥, Mw⊃Vr, and Mw+d⊃U. Applying Lemma 7 as above, we can conclude that e0=x+1, ew=f−x−1, ed=g−x, ew+d=x+1, and ei=0 for all other i.
3. (3)
If w=d, again by arguments similar to those above, we can show that e0=x+1, ew=f+g−2x−1, ew+d=x+1, and ei=0 for all other i.
Subcase 2: When ℓ∣m−1.
In this case, a=0, but ℓ∤2m−3. So d=vℓ(q2m−3+1)=vℓ(q+1)≤vℓ(q2−1)=w, with the equality holding if and only if ℓ=2.
So we have either a≤d<w+a<w+a+d, or d<a<w+a<w+a+d.
- (1)
If a<d<w+a<w+a+d, we have Md⊂Ma. So by Theorem 15 Ma⊃Md⊃C+Vs=(U′)⊥. Since Mw+a⊃Vr and d<w+a, Theorem 15 implies Md⊃Vs+Vr=U⊥. We also have Mw+a⊃Vr and Mw+a+d⊃U. Thus we have dim(Ma)≥dim(U′⊥)=f+g+1−x, dim(Mw)≥dim(U⊥)=f+g−x, dim(Mw+a)≥f, and dim(Mw+a+d)≥x+1.
Now,
[TABLE]
Thus by Lemma 7, setting j=4, s1=f+g+1−x, s2=f+g−x, s3=f, s4=x+1, s5=dim(ker(A))=0, t1=a, t2=d, t3=w+a, and t4=w+a+d, we conclude that e0=x, ea=1, ed=g−x, ew+a=f−x−1, ew+a+d=x+1, and ei=0 for all other i.
2. (2)
If d<a<w+a<w+a+d, by arguments similar to those above, we can show
Md⊃(U′)⊥, Ma⊃C Mw+d⊃Vr, and Mw+a+d⊃U. Now by applying Lemma 7 like above, we have e0=x, ea=1, ed=g−x, ew+a=f−x−1, ew+a+d=x+1, and ei=0 for all other i.
3. (3)
If d=a<w+a<w+a+d, by similar arguments,
Ma⊃(U′)⊥, Mw+a⊃Vr, and Mw+a+d⊃U.
Now by applying Lemma 7 like above, we can show that e0=x, ea=ed=g+1−x, ew+a=f−x−1, ew+a+d=x+1, and ei=0 for all other i.
12.2.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and Lℓ with L.
We set vℓ([1m−1]q2)=a, vℓ(q2m−3+1)=d, and vℓ(q2m−1+1)=c. Then vℓ(k)=vℓ(μ)=a+d, vℓ(v)=vℓ([1m]q2(q2m−1+1))=c. So vℓ(t)=a+c, vℓ(u)=d, and vℓ(∣K∣)=(a+c)f+dg−c.
As L(1)=0, we have ⟨1⟩⊂Mi for all i.
Since s is an eigenvalue of valuation d, Lemma 8 implies Md⊃Vr. So by Theorem 15, we see that Md⊃Vs⊕⟨1⟩.
Since t is an eigenvalue of valuation a+c, Lemma 8 implies Vr⊂Ma+c.
Lemma 10 gives us C⊂Ma and U′⊂Ma+c+d. Thus by Theorem 15, U′⊕⟨1⟩=U⊂Ma+c+d.
Subcase 1: When ℓ∤m−1.
In this case, a=0, as vℓ([1m−1]q2)=0. Thus vℓ(∣K∣)=cf+dg−c. We apply Lemma 8, and Theorem 15 to conclude the following.
- (1)
If c<d<d+c,
From the information we gathered above, we have
Mc⊃Vr and Mc⊃Md⊃Vs⊕⟨1⟩. Applying Theorem 15 gives us Mc⊃U⊥ and hence dim(Mc)≥f+g−x.
We also have by Theorem 15, dim(Md)≥g+1 and dim(Md+c)≥x+1.
Now we have, c(f+g−x−(g+1))+d(g+1−(x+1))+(c+d)(x+1−1)=cf+dg−c=vℓ(∣K∣).
So by Lemma 7, setting j=3, s1=f+g−x, s2=g+1, s3=x+1, s4=dim(ker(L))=1, t1=c, t2=d, and t3=c+d, we have e0=x+1, ec=f−x−1, ed=g−x, ec+d=x, and ei=0 for all other i.
2. (2)
If d<c<d+c,
By arguments similar to those above, we can show
Md⊃U⊥, and dim(Md)≥f+g−x;
Mc⊃Vr, and dim(Mc)≥f+1; and
Md+c⊃U, and dim(Md+c)≥x+1.
By applying Lemma 7 as above, we can show that e0=x+1, ec=f−x−1, ed=g−x, ec+d=x, and ei=0 for all other non-zero i.
3. (3)
If c=d<d+c, by arguments similar to those above we can show e0=x+1, ec=f+g−2x−1, ec+d=x, and ei=0 for all other i.
Subcase 2: When ℓ∣m−1.
As q≡−1(modℓ) and ℓ∣m−1, by the observations at the beginning of the subsection, we have c=d. We apply Lemma 7 and Theorem 15 to conclude the following.
- (1)
Assume that a<c=d<a+d<a+c+d. As C⊂Ma, and Vs⊂Mc⊂Md, by Theorem 15 Md⊃(U′)⊥, and thus dim(Md)≥f+g+1−x. Also by Theorem 15, since Vr⊂Ma+d⊂Mc, Mc⊃U⊥ and thus dim(Mc)≥f+g−x. We also have U⊂Ma+c+d, Vr⊂Ma+d, and thus dim(Md+a)≥f, and dim(Ma+c+d)≥x+1.
We have
a(f+g+1−x−(f+g−x))+c(f+g−x−(f))+(a+d)(f−(x+1))+(a+c+d)(x+1−1)=(a+d)f+cg−(a+d)=vℓ(∣K∣).
So by Lemma 7, setting j=4, s1=f+g+1−x, s2=f+g−x, s3=f, s4=x+1 s5=dim(ker(L))=1, t1=a, t2=c, t3=a+d, and t4=a+c+d, we have e0=x, ea=1, ec=g−x, ea+d=f−x−1, ea+c+d=x, and ei=0 for all other non-zero i.
2. (2)
Assume that c=d<a<a+d<b+c+d. Then by arguments similar to those above, Mc⊃C+Vs=(U′)⊥, Ma⊃C, Ma+d⊃Vr, and Ma+c+d⊃U. Now applying Lemma 7 as above, we have e0=x, ea=1, ec=g−x, ea+d=f−x−1, ea+c+d=x, and ei=0 for all other non-zero i.
3. (3)
If c=d=a<a+d<a+c+d, then by arguments similar to those above, we can show e0=x, ec=g+1−x, ea+d=f−x−1, ea+c+d=x, and ei=0 for all other i.
12.3. ℓ-elementary divisors of S and K when ℓ∣q+1, and ℓ∣m.
12.3.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and Aℓ with A.
In this case ℓ∤m−1 and thus ℓ∤[1m−1]q2 and vℓ(q2m−2−1)=vℓ(q2−1). As ℓ∤2m−3 and ℓ∤2m−1, we have vℓ(s)=vℓ(q2m−3+1)=vℓ(q2m−1+1)=vℓ(q+1)≤vℓ(q2−1).
Set w=vℓ(q2−1)=vℓ(r) ,vℓ(q2m−3+1)=vℓ(s)=d.
We have vℓ(∣S∣)=wf+dg+d, and vℓ(k)=vℓ(μ)=d
Observe that d≤w<d+w.
As r is an eigenvalue of valuation w≥d and s,k are eigenvalues of valuation d, by Lemma 8 and Theorem 15,
Md⊃Vr+Vs=U⊥, and Mw⊃Vr. By Lemma 10,
U⊂Mw+d. Thus by Theorem 15, dim(Md)≥f+g−x, dim(Mw)≥f and dim(Mw+d)≥x+1.
We have d(f+g−x−f)+w(f−(x+1))+(d+w)(x+1)=vℓ(∣S∣).
So by Lemma 7, setting j=3, s1=f+g−x, s2=f, s3=x+1, s4=dim(ker(A))=0, t1=d, t2=w, and t3=w+d, we have e0=x+1, ed=g−x, ew=f−x−1, ew+d=x+1, and ei=0 for all other i.
12.3.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and Lℓ with L.
Since ℓ∤m−1, we have ℓ∤[1m−1]q2 and thus vℓ(q2m−2−1)=vℓ(q2−1).
As ℓ∤2m−3 and ℓ∤2m−1, we have vℓ(s)=vℓ(q2m−3+1)=vℓ(q2m−1+1)=vℓ(q+1)≤vℓ(q2−1). Set vℓ(q2m−1+1)=d and vℓ([1m]q2)=b.
We have vℓ(k)=vℓ(μ)=d, vℓ(v)=b+d, vℓ(t)=d, vℓ(u)=d+b, and vℓ(∣K∣)=df+(d+b)g−(b+d).
As L(1)=0, we have ⟨1⟩⊂Mi for all i.
Since t is an eigenvalue of valuation d, and u is an eigenvalue of valuation b+d, by Lemma 8 and Theorem 15, we see that
Md⊃Vr+Vs=U⊥ and Md+b⊃Vs.
By Lemma 10, we have U⊂M2d and U′⊂Mb+2d.
We apply Lemma 7 and Theorem 15 we arrive at the following conclusions.
- (1)
If b<d, 2d>b+d, we have Mb+d⊃M2d+Vs⊃U+Vs. Thus by Theorem 15, we see that Mb+d⊃M and thus dim(Mb+d)≥g+1. Since Md⊃U⊥, M2d⊃U and Mb+2d⊃U′, Theorem 15 implies dim(M)d≥f+g−x dim(M2d)≥x+1, and dim(Mb+2d)≥x.
Now, d(f+g−x−(g+1))+(b+d)(g+1−(x+1))+2d(x+1−x)+(b+2d)(x−1)=vℓ(∣K∣).
So by Lemma 7, setting j=4, s1=f+g−x, s2=g+1, s3=x+1, s4=x, s5=dim(ker(L))=1, t1=d, t2=b+d, t3=2d, and t4=b+2d, we have e0=x+1, ed=f−x−1, eb+d=g−x, e2d=1, eb+2d=x−1, and ei=0 for all other i.
2. (2)
If b>d, by similar arguments, M2d⊃M, Mb+d⊃Vs, Md⊃U⊥, M2d⊃U and Mb+2d⊃U′. Applying Lemma 7 like in the above case, we have e0=x+1, ed=f−x−1, eb+d=g−x, e2d=1, eb+2d=x−1, and ei=0 for all other i.
3. (3)
If b=d, by arguments similar to those above, we have e0=x+1, eb=f−x−1, eb+d=g−x+1, ed+2b=x−1, and ei=0 for all other i.
13. ℓ-elementary divisors of S and K when Γ(V)=Γuo(q,m), and ℓ∣q+1.
Given the graph Γuo(q,m) and a prime ℓ, table 13 shows that Aℓ (equivalently Lℓ) is nilpotent if and only if ℓ∣q+1. In this section we compute the ℓ-elementary divisors of S and K when Γ(V)=Γuo(q,m) and ℓ∣q+1.
From now on in this section, we denote Γuo(q,m) by Γuo, and ℓ is a prime that meets the description in the previous paragraph.
We set h=23, and z=m in Lemma 3 and Lemma 2 to get parameters for this graph. Thus Γuo(q,m) is an SRG with parameters
v=[1m]q2(q2m+1+1), k=q2[1m−1]q2(q2m−1+1), λ=(q2−1)+q4((q)2m−3+1)[1m−2]q2, and μ=[1m−1]q2(q2m−1+1).
The adjacency matrix A has eigenvalues (k,r,s)=(k,q2m−2−1,−(1+q2m−1))
with multiplicities (1,f,g)=(1,q+1q3[1m]q2(q2m−1+1),q−1q2[1m−1]q2(q2m−2−1)).
So the Laplacian L has eigenvalues (0,t,u)=(0,k−r,k−s)=(0,[1m−1]q2(1+q2m+1),[1m]q2(1+q2m−1))
with multiplicities (1,f,g).
13.1. Submodule structure
We now recall from §7 the definitions of C, C′ U, U′, Vr and Vs in the context of the graph Γuo. In this case G(V)=U(2m+1,q2).
By Corollary 2.10, Corollary 5.6, and Proposition 5.14 of [13], we have the following result.
Theorem 16**.**
If ℓ∣q+1, the following are true.
- (1)
If ℓ∤m, then
C⊃Vr⊃U=⟨1⟩⊕Vs⊃Vs=U′.
2. (2)
If ℓ∣m, then
C⊃Vr⊃U⊃Vs=U′⊃⟨1⟩.
3. (3)
We have dim(C)=f+1 and dim(U)=g+1.
13.2. Elementary divisors of S and K, when ℓ∤m, and ℓ∣q+1
13.2.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and Aℓ with A.
We set vℓ(q2−1)=w, vℓ([1m−1]q2)=a and vℓ(q2m−1+1)=d. So we have vℓ(r)=w+a, vℓ(s)=d, vℓ(k)=vℓ(μ)=a+d, and vℓ(∣S∣)=(w+a)f+dg+a+d.
We have a<w+a<w+a+d.
As r is an eigenvalue of valuation w+a, by Lemma 8, we have
Ma+w⊃Vr.
By Lemma 10, Ma⊃C, and Mw+a+d⊃U. Thus by Theorem 16, dim(Ma)≥f+1, dim(Mw+a)≥f, and dim(Mw+a+d)≥g+1.
Now, a(f+1−f)+(w+a)(f−(g+1))+(w+a+d)(g+1)=(w+a)f+dg+a+w=vℓ(∣S∣).
So by Lemma 7, setting j=3, s1=f+1, s2=f, s3=g+1, s4=dim(ker(A))=0, t1=a, t2=w+a, and t3=w+a+d, we have e0=g, ea=1, ew+a=f−g−1, ew+a+d=g+1, and ei=0 for all other i.
13.2.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and Lℓ with L.
We set vℓ([1m−1]q2)=a, vℓ(q2m−1+1)=c, and vℓ(s)=vℓ(q2m+1+1)=d So we have vℓ(t)=a+d, vℓ(u)=c, vℓ(v)=d, and vℓ(∣K∣)=(a+d)f+cg−d.
By Lemma 10 we have C⊂Ma and U⊂Ma+d+c. As t is an eigenvalue of valuation a+d by Lemma 8, we have
Ma+d⊃Vt=Vr.
By Theorem 16, we have dim(Ma)≥f+1, dim(Ma+d)≥f, and dim(Ma+c+d)≥g+1.
Now a(f+1−f)+(a+d)(f−(g+1))+(a+c+d)(g+1−1)=vℓ(∣K∣).
So by Lemma 7, setting j=3, s1=f+1, s2=f, s3=g+1, s4=dim(ker(L))=1, t1=a, t2=a+b, and t3=a+b+c, we have e0=g, ea=1, ed+a=f−g−1, ed+a+c=g, and ei=0 for all other i.
13.3. Elementary divisors of S and K, when ℓ∣m, and ℓ∣q+1
13.3.0.1 Elementary divisors of S.
We identify Mi(A) with Mi and Aℓ with A.
As ℓ∣m and q≡−1(modℓ), we have
vℓ(q2−1)=vℓ(r), and vℓ(s)=vℓ(k)=. Set vℓ(q2−1)=w and vℓ(q2m−1+1)=d. We have vℓ(∣S∣)=wf+dg+d.
As r is an eigenvalue of valuation w, Lemma 8 implies Vr⊂Mw.
By Theorem 10, we have Mw+d⊃U.
By Theorem 16, we have dim(Mw)≥f, and dim(Mw+d)≥g+1.
Now, w(f−(g+1))+(w+d)(g+1)=vℓ(∣S∣).
So by Lemma 7, setting j=2, s1=f, s2=g+1, s3=dim(ker(A))=0, t1=w, and t2=w+d, we have e0=g+1, ew=f−g−1, ew+d=g+1, and ei=0 for all other i.
13.3.0.2 Elementary divisors of K.
We identify Mi(L) with Mi and Lℓ with L.
As ℓ∣m, we have vℓ(q2m+1+1)=vℓ(q2m−1+1). We set vℓ([1m]q2)=b and vℓ(q2m+1+1)=d. We have vℓ(t)=d, vℓ(u)=b+d, vℓ(v)=b+d, and vℓ(∣K∣)=df+(b+d)g−(b+d).
As t is an eigenvalue of valuation d, we have Md⊃Vr.
Lemma 10 gives us Mb+2d⊃U′ and U⊂M2d.
By Theorem 16, we have dim(Md)≥f, dim(M2d)≥g+1, and dim(Mb+2d)≥g.
Now,
d(f−(g+1))+(2d)(g+1−g)+(b+2d)(g−1)=vℓ(∣K∣).
So by Lemma 7, setting j=3, s1=f, s2=g+1, s3=g, s4=dim(ker(L))=1, t1=d, t2=2d, and t3=b+2d, we have e0=g+1, ed=f−g−1, e2d=1, eb+2d=g−1, and ei=0 for all other i.
Acknowledgements
This work was partially supported by a grant from the Simons Foundation (#204181 to Peter Sin). We thank the anonymous referees for valuable suggestions and comments.