#17464: Computing the automorphism group of a graph with Bliss
-------------------------+-------------------------------------------------
Reporter: azi | Owner:
Type: | Status: needs_review
enhancement | Milestone: sage-6.5
Priority: major | Resolution:
Component: graph | Merged in:
theory | Reviewers: Nathann Cohen
Keywords: | Work issues:
Authors: | Commit:
Jernej Azarija | 54b0865d4837861321e3cb9dacf5fc648a2ebfe5
Report Upstream: N/A | Stopgaps:
Branch: |
public/bliss |
Dependencies: |
#17552, #18145 |
-------------------------+-------------------------------------------------
Comment (by ncohen):
Hello,
> Is bliss making random choices during the computation? There is no need
for non-deterministic choices in graph automorphisms, I'm sure.
A permutation group can have different sets of generators, and that's the
trouble here: Sage and Nauty do not obtain the same. The groups are equal,
however, as illustrated above.
> Patch it out and/or setting the seed might be a better fix in the long
run.
There was a real bug in there. I fixed it, and sent an email to Jernej
hoping that he can take a look at it soon.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/17464#comment:148>
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.
