On Thu, Feb 21, 2013 at 02:13:54PM -0800, Anne Schilling wrote:
> > What do you mean by "pretty slow" ?
Darn fast actually for an isomorphism test! But we are getting spoiled
having fast graph isomorphism and now want even more :-)
Cheers,
Nicolas
--
Nicolas M. Thi
Hi Nathann,
Thank you for your answer!
> Question -1 : do you check many times whether a GIVEN AND FIXED GRAPH
> g is isomorphic to some other ? Because is_isomorphic works by
> computing a canonical form for each graph, then checking that these
> two forms are equal. Hence if you want to do this
Thanks to Travis, the queue now works again on 5.6!
Cheers,
Nicolas
--
Nicolas M. Thiéry "Isil"
http://Nicolas.Thiery.name/
--
You received this message because you are subscribed to the Google Groups
"sage-combinat-devel" group.
To unsubscribe from this group
Hey Franco and 5.6 combinat users,
Everything in the combinat queue should now be working for 5.6. Let me
know if there are any problems. Nicolas had 5.6 that I could run tests on.
Thank you for that.
Best,
Travis
--
You received this message because you are subscribed to the Google Groups
> Right now, I am having some trouble applying the patch by Benjamin Jones:
> though it seems to apply, it doesn't. I must be doing something
> stupid...
The patch is a couple of years old, and we wouldn't expect it
to apply. It contains some code (for Demazure operators) that is
no longer relev
Arg Didn't see that the mail had been sent to the combinat-list... O_o
Hello !!!
> I am trying to compute isomorphisms of (partial) crystal graphs
> and use the digraph is_isomorphic method for this. More precisely,
> if G and G1 are digraphs I would like
>
> G1.is_isomorphic
Hi,
Right now, I am having some trouble applying the patch by Benjamin Jones:
though it seems to apply, it doesn't. I must be doing something stupid...
Anyway, if I understood it correctly, what that code does is to plot the
weight diagram of a representation in a realization of the weight latt
Hey Franco (and Andrew),
Could you post the reject file that you're getting so I'll know where to
look?
Thank you,
Travis
On Wednesday, February 20, 2013 10:35:39 PM UTC-5, Travis Scrimshaw wrote:
>
> Hey Franco,
>These all percolate from #6495 not applying. Andrew also came across
> th
Hi Nathannn,
I am trying to compute isomorphisms of (partial) crystal graphs
and use the digraph is_isomorphic method for this. More precisely,
if G and G1 are digraphs I would like
G1.is_isomorphic(G,edge_labels=True)
This is pretty slow in my examples (with graphs of about
