fast_polynomial ( http://trac.sagemath.org/sage_trac/ticket/13358 ) is a
sage package that improves significantly the composition of univariate and
multivariate polynomial. In particular, the composition of polynomial can
be 10 times faster than the current implementation. Currently, it can be
Youps, there was a little problem in my patch for the univariate
fraction field case. This patch replaces the previous one.
Guillaume
229c229,236
<
---
>
> elif sage.rings.fraction_field.is_FractionField(self.base_ring()) and
> (self.base_ring().base_ring() is ZZ or
> self.base_ring().ba
Hi,
On Nov 22, 8:10 pm, Martin Albrecht <[EMAIL PROTECTED]>
wrote:
> if you want to give it a try have a look at
>
>sage/rings/polynomial/polynomial_singular_interface.py
Cool: I modified this python script, ran some tests and now the
singular interface is well used for fraction field coeffi
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_conve
