#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 mabshoff):
Replying to [comment:3 john_perry]:
Hi John,
> Implementing Lazard's algorithm to solve this required a few
subalgorithms as well. Rather than clutter
{{{multi_polynomial_ideal.py}}}, I appended the functions to
{{{toy_buchberger.py}}}. That seemed a natural location, since this is a
toy implementation, and computing the variety of a zero-dimensional ideal
is not an unnatural follow-up to Buchberger's algorithm. That said, if
someone prefers that this be placed in {{{multi_polynomial_ideal.py}}}, or
even in a new file, I can work with that.
I would suggest to place it in its own file, but maybe Martin should pipe
in there, too.
Cheers,
Michael
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5146#comment:4>
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
-~----------~----~----~----~------~----~------~--~---
