s
well as it could be.
Also, after a certain cutoff, 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
On Thu, Mar 10, 2011 at 11:00 PM, Anne Schilling wrote:
> Great, thank you!!
>
> When do you think a positive review will happen for this ticket?
Anne,
Please feel free to review the ticket yourself! I don't really know
when it will get reviewed. Having contributed a patch rules me out, or
I'd d
es? That would be the most natural in the setting of crystal
> isomorphisms that I need. Or is there another easy way to obtain
> the vertex isomorphism from the current code?
>
> Best,
>
> Anne
>
>
> On 12/22/10 9:44 AM, Robert Miller wrote:
>>
>> On Dec 17, 6:
On Dec 17, 6:38 pm, Anne Schilling 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
"sage-combinat-de
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: D.is_is
Dima,
On Tue, Aug 17, 2010 at 5:40 AM, Dima Pasechnik wrote:
> I certainly know what GAP can do (For my current needs, I lifted off
> the corresponding GAP code from GRAPE package), I asked whether there
> is a native Sage implementation of Schreier vector somewhere in the
> Sage code.
No, but t
On Wed, Aug 4, 2010 at 12:55 PM, Mike Hansen wrote:
> On Wed, Aug 4, 2010 at 8:18 AM, Robert Miller wrote:
>> 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&#
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 be
On Fri, Jul 23, 2010 at 10:05 PM, William Stein 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 the Google Group
> 1) Max Genus:
> a [ ] Remove every reference to maximal genus
> b [ ] Raise NotImplementedError for max genus computations that are
> not supported
> c [ ] Delay everything indefinitely until somebody cares enough to
> make max genus work while respecting embeddings (I probably won't do
> this)
>
10 matches
Mail list logo
