OurBigBook About$ Donate
 Sign in Sign up

Symplectic dual polar graph (d(U,W)=m−dim(U∩W))

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Graph theory Graph Distance-transitive graph
2026-10-14  0 By others on same topic  0 Discussions Create my own version
Vertices are Lagrangian subspaces of a 2m-dimensional symplectic vector space, joined when they intersect in codimension one. A pair with intersection dimension m−r admits a symplectic basis in which U=⟨e1​,…,em​⟩ and W=⟨f1​,…,fr​,er+1​,…,em​⟩. Replacing ei​ successively by fi​ gives an isotropic path of length r, while one edge can increase intersection dimension with a fixed target by at most one. Equal-distance ordered pairs have the same adapted form, so the symplectic group acts distance-transitively.

 Ancestors (7)

  1. Distance-transitive graph
  2. Graph
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 4 / 5 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook