#18997: Unitary and symplectic (dual) polar graphs
-------------------------+-------------------------------------------------
Reporter: | Owner:
dimpase | Status: needs_work
Type: | Milestone: sage-6.9
enhancement | Resolution:
Priority: major | Merged in:
Component: graph | Reviewers: Nathann Cohen
theory | Work issues:
Keywords: | Commit:
Authors: Dima | 35a9b1752da8eadddc03b68e584ceffa9e14bc93
Pasechnik | Stopgaps:
Report Upstream: N/A |
Branch: |
u/dimpase/unitary |
Dependencies: |
#18972 |
-------------------------+-------------------------------------------------
Comment (by dimpase):
Replying to [comment:19 ncohen]:
> - Why is this only checked when `algorithm="gap"`?
> {{{
> if d < 1 or d%2 != 0:
> raise ValueError("d must be even and greater than 2")
> }}}
>
oops, it's a bug...
>
> - in `_polar_Graph` -- why upper case `G`?
>
> - same function: would it make sense to compute the list of edges of the
graph
> in GAP instead of doing it in Sage, which triggers GAP calls? Just
wondering,
> as it seems that interacting with GAP is often costly.
this is `libGAP`, we can be reasonably sure that at least with non-
complicated objects,
like integers, this is as quick as native Python... (certainly, replacing
`libgap` with `gap` there would lead to a huge performance hit).
--
Ticket URL: <http://trac.sagemath.org/ticket/18997#comment:21>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
