#5146: [with patch; needs review] implement MPolynomial_ideal.variety() for
GF(p)
with p > than what Singular supports
---------------------------------+------------------------------------------
Reporter: malb | Owner: malb
Type: defect | Status: new
Priority: major | Milestone: sage-3.4.1
Component: commutative algebra | Keywords:
---------------------------------+------------------------------------------
Comment(by john_perry):
New version of the patch:
* Separated functions related to triangularization into a new file,
{{{toy_variety.py}}}
* Completely rewrote two subalgorithms that check for and express linear
dependence between polynomials. Lazard did not specify the details, and I
implemented the previous versions in a manner that in no way could be
described as intelligent. (Ironically, I'm scheduled to teach introductory
linear algebra this summer.) The present version uses basic linear algebra
to answer these questions.
* Removed some doctests on the same two functions, because they are now
nested. If there is a way to doctest nested functions, let me know, and
I'll restore the doctests.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5146#comment:5>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
