#19098: implement Taylor 2-graphs for U_3(q) and related srg's
-------------------------------------+-------------------------------------
Reporter: dimpase | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.9
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: Dima Pasechnik | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/dimpase/taylor2graphs | d7878be6695b3386b8e5e10ed71634b08519db7d
Dependencies: #18972, #18997, | Stopgaps:
#19099, #19133 |
-------------------------------------+-------------------------------------
Comment (by ncohen):
Helloooooooooo Dima,
Two questions about this branch:
- It seems that you do not use the `taylor_twograph` function anywhere. If
you
think that it is useful in its own right I do not mind, but I couldn't
help
but notice the apparently large overlap between the code of
`taylor_twograph`
and the code of `TaylorTwographDescendantSRG`. Couldn't you let one of
the two
functions call the other? Especially since with the speedup commit, it
takes
less time to build the graph.
- I do not understand the point of this line. Could you explain? To me all
it
does is add a vertex `v0`
{{{
G = H.union(Graph([[v0], lambda x, y: x != y])) # to make sure vertices
are not relabeled
}}}
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19098#comment:36>
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.
