#13721: Additional tests for graph symmetries and an improvement of
is_vertex_transitive
----------------------------------+-----------------------------------------
Reporter: azi | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.6
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Jernej Azarija | Merged in:
Dependencies: | Stopgaps:
----------------------------------+-----------------------------------------
Comment (by ncohen):
Helloooooooo again !
Well, the patch still does not apply on Sage even if that is no big deal
(the last version is 5.6.beta1 and not 5.4, see [1]), but I have another
question : why do you prefer to use {{{
new_partition, T = self.automorphism_group(partition,translation=True)
new_partition.is_transitive(domain=[T[x] for x in cell])
}}}
rather than
{{{
new_partition, T =
self.automorphism_group(partition,return_group=False,translation=True)
len(partition)=len(new_partition)
}}}
As I understand it, `new_partition` is necessarily more refined than
`partition`, and they have the same length if and only if the group of
automorphisms of `G` which respect `partition` has as orbits the list
`partition`, which is exactly what we want `O_o`
By the way, as it is the variable that you name `new_partition` is not a
partition, but a Group.
Nathann
Nathann
[1] https://groups.google.com/forum/?fromgroups#!forum/sage-release
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13721#comment:23>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
