Changes between Version 3 and Version 9 of Ticket #18997


Ignore:
Timestamp:
08/06/15 23:24:00 (6 years ago)
Author:
dimpase
Comment:

actually, there already was graphs.SymplecticGraph, so to it I just added another algorithm to build it, which is faster for fields of size bigger than 3.

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #18997

    • Property Commit changed from 971476d1d7bb4a32cacf70c1d8de478295423aa9 to cd864554e81ada74a00759e40ec6edd7bac609ca
    • Property Summary changed from Unitary and symplectic polar graphs to Unitary and symplectic (dual) polar graphs
  • Ticket #18997 – Description

    v3 v9  
    1 implement the classical unitary (reps. symplectic) polar graphs `U(n,q)` (resp. `Sp(2d,q)`), see
    2 http://www.win.tue.nl/~aeb/graphs/srghub.html
     1implement the classical unitary (reps. symplectic) ordinary and dual polar graphs `U(n,q)` (resp. `Sp(2d,q)`), see
     2http://www.win.tue.nl/~aeb/graphs/srghub.html for the ordinary ones, and [BCN89] for the dual ones (for these of diameter bigger than 2).