Adv. Geom. 4 (2004), 105–117 Advances in Geometry ( de Gruyter 2004
A four-class association scheme derived from a hyperbolic quadric in PG(3, q)
Tatsuya Fujisaki (Communicated by E. Bannai)
Abstract. We prove the existence of a four-class association scheme on the set of external lines with respect to a hyperbolic quadric of PGð3; qÞ where q d 4 is a power of 2. This result is an analogue of the one by Ebert, Egner, Hollmann and Xiang. Taking a quotient of this associa- tion scheme yields a strongly regular graph of Latin square type. We show that this strongly regular graph can also be obtained by a generalization of the construction given by Mathon.
1 Introduction In the paper [5], Ebert, Egner, Hollmann and Xiang constructed a four-class sym- metric association scheme by using the set of secant lines with respect to an ovoid O of PGð3; qÞ for q d 4 a power of 2. We can regard this association scheme as defined on the set of external lines by taking the null polarity with respect to O. In this paper, we consider an analogous construction by a hyperbolic quadric. We construct a four- class symmetric association scheme by using the set of external lines with respect to a hyperbolic quadric of PGð3; qÞ. Each relation is invariant under the action of the orthogonal group Oþð4; qÞ but the set of relations is not the set of orbitals on the set of external lines. Indeed, there are more orbitals than relations. Moreover, a quo- tient of this association scheme forms a strongly regular graph of Latin square type. We also prove that this strongly regular graph is isomorphic to the one constructed from a direct product of a pseudo-cyclic symmetric association scheme defined by the action of SLð2; qÞ on the right cosets SLð2; qÞ=O ð2; qÞ, which is a generalization of the construction given by Mathon [10]. This isomorphism is obtained by an iso- morphism between SLð2; qÞ2 and Wþð4; qÞ.
2 Association schemes, strongly regular graphs and projective spaces
Let X be a finite set and let fRig0cicd be relations on X, that is, subsets of X X. Then X ¼ðX; fRig0cicd Þ is called a d-class symmetric association scheme if the fol- lowing conditions are satisfied. 106 Tatsuya Fujisaki
1. fRig0cicd is a partition of X X.
2. R0 is diagonal, that is, R0 ¼fðx; xÞjx A Xg.
3. fðy; xÞjðx; yÞ A Rig¼Ri for any i. A k A A A 4. For any i; j; k f0; 1; ...; dg, pij :¼jfz X jðx; zÞ Ri; ðy; zÞ Rjgj is independent of the choice of ðx; yÞ in Rk.
For i A f0; ...; dg, let Ai be the adjacency matrix of the relation Ri, that is, Ai is indexed by X and 1ifðx; yÞ A Ri; ðAiÞxy :¼ 0ifðx; yÞ B Ri:
Then we have
Xd k AiAj ¼ pij Ak k¼0 for any i; j A f0; ...; dg.SoA0; A1; ...; Ad form a basis of the commutative algebra generated by A0; A1; ...; Ad over the complex field (which is called the Bose–Mesner algebra of X). Moreover this algebra has a unique basis E0; E1; ...; Ed of primitive idempotents. One of the primitive idempotents is jXj 1J where J is the matrix whose 1 entries are all 1. So we may assume E0 ¼jXj J. Let P ¼ðpjðiÞÞ0ci; jcd be the ma- trix defined by
ðA0 A1 ...Ad Þ¼ðE0 E1 ...Ed ÞP:
We call P the first eigenmatrix of X. Note that fpjðiÞj0 c i c dg is the set of eigen- values of Aj. The first eigenmatrix satisfies the orthogonality relation:
Xd 1 jXj p ðiÞp ð jÞ¼ d ; k n n m ij n¼0 n i
0 where ki ¼ pii and mi ¼ rank Ei. We say that X is pseudo-cyclic if there exists an integer m such that rank Ei ¼ m for all i A f1; ...; dg. Note that in this case, jXj¼ 0 A dm þ 1 and ki ¼ pii ¼ m for all i f1; ...; dg (see [1, p. 76]). Let G be a finite group and K be a subgroup of G. Then G acts naturally on the set G=K G=K with orbitals R0; R1; ...; Rd , where we let R0 ¼fðgK; gKÞjgK A G=Kg. If all orbitals are self-paired, then X ¼ðG=K; fRig0cicd Þ forms a symmetric associa- tion scheme. We denote this association scheme by XðG; KÞ. For a strongly regular graph with parameters ðn; k; l; mÞ, one of the eigenvalues of 2 its adjacency matrix is k, and the others y1; y2 are the solutions of x þðm lÞx þ ðm kÞ¼0. We can identify the pair of a strongly regular graph and its complement with a two-class symmetric association scheme whose first eigenmatrix is A four-class association scheme derived from a hyperbolic quadric in PGð3; qÞ 107 2 3 1 kn k 1 6 7 4 1 y1 1 y1 5 ð1Þ 1 y2 1 y2
In the paper [10], Mathon constructed a strongly regular graph from the pseudo- cyclic symmetric association scheme XðSLð2; 8Þ; O ð2; 8ÞÞ. The next lemma is a gen- eralization of this construction, due to Brouwer and Mathon [2]. Godsil [7] remarks that it can also be proved by Koppinen’s identity [9] (see also [6, Theorem 2.4.1]).
Lemma 2.1. Let X ¼ðX; fRig0cicd Þ be a pseudo-cyclic symmetric association scheme on dm þ 1 points. Then the graph DðXÞ whose vertex set is X X, where two distinct 0 0 0 0 vertices ðx; yÞ and ðx ; y Þ are adjacent if and only if ðx; x Þ; ðy; y Þ A Ri for some i 0 0, is a strongly regular graph of Latin square type with parameters
ðjXj2; mðjXj 1Þ; jXjþmðm 3Þ; mðm 1ÞÞ:
Proof. The direct product of X is ðX X; fRijg0ci; jcd Þ, where
0 0 0 0 Rij :¼ fððx; yÞ; ðx ; y ÞÞ j ðx; x Þ A Ri; ðy; y Þ A Rjg:
If P is the first eigenmatrix of X, then P n P is the first eigenmatrix of ðX X, 6d fRijg0ci; jcd Þ. The edge set of DðXÞ is defined to be j¼1 Rjj. Then the eigenvalues of the adjacency matrix of DðXÞ are Xd 0 0 pjðiÞpjði Þj0 c i; i c d : j¼1
Since X is psuedo-cyclic, k0 ¼ m0 ¼ 1, kj ¼ mi ¼ m for i; j 0 0. Hence the ortho- gonality relation implies 8