One difficulty with implementing this is that there are lots of
different polynomial classes, and also lots of different __pow__
methods. In each case one could perhaps test to see of the
characteristic was p>0 and the exponent a power of p, and call special
code. (I think this was done a while a
Dear Simon,
On Nov 20, 2:19 pm, Simon King wrote:
> Hi Luis!
>
> First, I would produce a clone of Sage, in order to not destroy your
> installation by mistake. So, in the shell, do
> sage -clone work
> where you can replace "work" by another word that you like (except
> "main").
>
> (...)
Th
Hi Luis!
On 20 Nov., 19:10, finotti wrote:
...
> I know that Sage developers have different priorities, but this is
> sort of important to me...
Definitely polynomials *are* a priority for some developers...
> So, is there a way I can redefine how Sage
> computes powers of polynomials in charac
Hi,
On Oct 20, 1:16 am, Robert Bradshaw
wrote:
> Interesting point, I've madehttp://trac.sagemath.org/sage_trac/ticket/7253
I know that Sage developers have different priorities, but this is
sort of important to me... So, is there a way I can redefine how Sage
computes powers of polynomials in
Interesting point, I've made http://trac.sagemath.org/sage_trac/ticket/7253
On Oct 19, 2009, at 1:49 PM, finotti wrote:
>
> Dear all,
>
> I need to compute some larger powers of polynomials in characteristic
> p>0. I've noticed that Sage does not do it very efficiently, as even
> f^(p^n) takes
