#14711: Weak references in the coercion graph
-------------------------------------+-------------------------------------
Reporter: jpflori | Owner: davidloeffler
Type: defect | Status: needs_work
Priority: critical | Milestone: sage-6.0
Component: number fields | Resolution:
Keywords: memleak, number | Merged in:
field, QuadraticField | Reviewers:
Authors: Simon King | Work issues: Fix doctests errors
Report Upstream: N/A | after merging master
Branch: | Commit:
u/SimonKing/ticket/14711 | d68c5df4618cc4fcf8ef215ee6b2f475be028209
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by SimonKing):
I found how Gröbner basis computation comes into play: When calling a
scheme morphism, a scheme is called, which involves for some map `S` to
test `S.codomain() == self`. This comparison involves comparing ideals,
and this means one needs to compute a Gröbner basis.
I only wonder why this comparison does not happen with strong maps. Also I
need to study why the comparison is not by identity.
--
Ticket URL: <http://trac.sagemath.org/ticket/14711#comment:148>
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/groups/opt_out.
