#17010: Random failure in diagram algebras
---------------------------------+------------------------
Reporter: vbraun | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: random_fail | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------+------------------------
Changes (by vbraun):
* cc: SimonKing (added)
Comment:
Something related to the coercion is getting garbage collected during the
execution of the command. On my desktop (a fast computer with gobs of RAM)
I always get the right answer. But if I use the trace hook to force run a
garbage collection between each Python command:
{{{#!python
def trace_gc(frame, event, arg):
import gc
gc.collect()
}}}
then a) everything gets dog slow, about 5 mins for the lines below, and b)
I get the wrong answer:
{{{
sage: sys.settrace(trace_gc)
sage: R.<x> = QQ[]
sage: BA = BrauerAlgebra(2, x, R)
sage: BA.ambient().has_coerce_map_from(BA)
False
}}}
--
Ticket URL: <http://trac.sagemath.org/ticket/17010#comment:1>
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.
