#1819: move crypto.mq.MPolynomialSystem somewhere else
-----------------------------------+----------------------------------------
Reporter: malb | Owner: malb
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.6.2
Component: commutative algebra | Keywords:
Author: Martin Albrecht | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-----------------------------------+----------------------------------------
Comment(by vbraun):
I don't see that anywhere in the `MPolynomialIdeal` class. Correct me if
I'm wrong, but the chosen generators and their order is immutable. Even
when computing a Groebner basis, the generators are not replaced by this
much more useful basis. On the other hand, there are methods like
`basis_is_groebner()` which are obviously basis-dependent. It seems to me
that Sage implements ideals very much as an immutable sequence of
polynomials with some methods attached. The individual methods do, of
course, need Groebner bases but they never change the underlying sequence
of polynomials.
I am aware that the ideals implicitly contain the term order, though I
found that a somewhat mixed blessing in #10708.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/1819#comment:16>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
