#16059: Equality vs hash for braid groups
-------------------------------------+-------------------------------------
Reporter: tmonteil | Owner:
Type: defect | Status: needs_review
Priority: major | Milestone: sage-6.2
Component: group theory | Resolution:
Keywords: braid group, | Merged in:
hash, Cayley graph | Reviewers: Travis Scrimshaw
Authors: Thierry Monteil | Work issues:
Report Upstream: N/A | Commit:
Branch: | 141adb09fe3e8f45079d706135dc071dc2e1eec7
u/tmonteil/equality_vs_hash_for_braid_groups| Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by tmonteil):
Actually, there is already an indirect check when `G` answers `Digraph on
31 vertices` (to be compared to `Digraph on 40 vertices` for the free
group, some vertices are merged). Is it enough ?
Otherwise, i do not know a short way to represent directed graphs in Sage,
but i could add a test for the undirected version of the graph using
`sparse6_string` representation along the following lines just after the
previous example, though i am not sure it is easy to read:
{{{
sage: graph_string = ':^_`aa`ddd`aHhh_lmmmfLqqlStt_HjWxxvW{{'
sage: G.to_undirected().is_isomorphic(Graph(graph_string))
True
}}}
What do you think ?
--
Ticket URL: <http://trac.sagemath.org/ticket/16059#comment:6>
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.
