On Nov 21, 6:10 pm, Guillaume Moroz <[EMAIL PROTECTED]> wrote:
> Hi,
Hi,
> I'm new to sage, and so far I like it!
>
:)
> Just my two cents here: 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
> athttp://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!
This sounds very much like http://trac.sagemath.org/sage_trac/ticket/687
- but I think malb should comment.
> Best regards,
>
> Guillaume
Cheers,
Michael
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
