On Fri, Jul 23, 2010 at 10:05 PM, William Stein wst...@gmail.com wrote:
Anyway, a slowdown of more than 1 microsecond on everything throughout
sage is absolutely unacceptable.
+1
--
Robert L. Miller
http://www.rlmiller.org/
--
You received this message because you are subscribed to
Going through some graph theory stuff, I noticed that the
documentation for cayley_graph mentions that the option connecting_set
is deprecated, but it isn't really. Just thought I'd ping the combinat
list about this...
--
Robert L. Miller
http://www.rlmiller.org/
--
You received this message
Anne,
The digraphs in sage also have isomorphism/automorphism groups
implemented. The pointer William gave you is for undirected graphs,
but if you go up a level you see much more generality...
sage: D = digraphs.RandomDirectedGNP(10, .2)
sage: E = digraphs.RandomDirectedGNP(10, .2)
sage:
On Dec 17, 6:38 pm, Anne Schilling a...@math.ucdavis.edu wrote:
Thank you, very nice! However, playing around with this, also in the setting
of crystals,
I came across the following bug: ...
Please see trac #10516.
--
You received this message because you are subscribed to the Google Groups
, GAP uses Monte Carlo algorithms, which
actually means that the results are not provably correct, just very
very probably so. I have not yet checked whether this has a bearing on
whether Sage's proof=True option is incorrect somewhere, but it is
possible.
Tom wrote:
Robert Miller has been hard
