English

Double Covers of Symplectic Dual Polar Graphs

Combinatorics 2015-09-22 v2

Abstract

Let Γ=Γ(2n,q)\Gamma=\Gamma(2n,q) be the dual polar graph of type Sp(2n,q)Sp(2n,q). Underlying this graph is a 2n2n-dimensional vector space VV over a field Fq{\mathbb F}_q of odd order qq, together with a symplectic (i.e. nondegenerate alternating bilinear) form B:V×VFqB:V\times V\to{\mathbb F}_q. The vertex set of Γ\Gamma is the set V{\mathcal V} of all nn-dimensional totally isotropic subspaces of VV. If q1q\equiv1 mod 4, we obtain from Γ\Gamma a nontrivial two-graph Δ=Δ(2n,q)\Delta=\Delta(2n,q) on V{\mathcal V} invariant under PSp(2n,q)PSp(2n,q). This two-graph corresponds to a double cover Γ^Γ\widehat{\Gamma}\to\Gamma on which is naturally defined a QQ-polynomial (2n+1)(2n+1)-class association scheme on 2V2|{\mathcal V}| vertices.

Keywords

Cite

@article{arxiv.1504.01067,
  title  = {Double Covers of Symplectic Dual Polar Graphs},
  author = {G. Eric Moorhouse and Jason Williford},
  journal= {arXiv preprint arXiv:1504.01067},
  year   = {2015}
}