#4582: use Singular's capabilities for computing over fraction fields
---------------------------------+------------------------------------------
Reporter: malb | Owner: malb
Type: enhancement | Status: new
Priority: major | Milestone: sage-3.3
Component: commutative algebra | Keywords:
---------------------------------+------------------------------------------
Guillaume Moroz wrote on [sage-devel]:
"
it seems that the sage interface to singular is not aware that Singular
handles multivariate polynomial rings with coefficients in a fraction
field.
{{{
sage: from sage.rings.polynomial.polynomial_singular_interface import
can_convert_to_singular
sage: r=Frac(QQ['a,b'])['x,y']
sage: can_convert_to_singular(r)
False
}}}
However, it is possible to define it in Singular: in this case, it would
be
{{{
ring R=(0,a,b),(x,y),dp;
}}}
(following the syntax 2. given at http://www.singular.uni-
kl.de/Manual/latest/sing_30.htm#SEC40)
In particular, Gröbner basis can be computed by Singular in these
polynomial rings more efficiently than the toy algorithm currently used.
"
I hope this can help!
Best regards,
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/4582>
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
-~----------~----~----~----~------~----~------~--~---
