Singular

 Page 1 of 1 [ 2 posts ]
 Print view | E-mail friend Previous topic | Next topic
Author Message
 Post subject: Large powers of polynomials in small characteristicPosted: Tue Apr 05, 2016 7:33 pm

Joined: Mon Sep 22, 2008 1:07 am
Posts: 3
Back in 2009, there was discussion on the Sage developers mailing list:

about the fact that in a multivariate polynomial ring of very small characteristic, raising a polynomial to a large power was being done suboptimally. Namely, one should really account for the fact that in characteristic p, raising to the p-th power acts on individual monomials; so to compute f^n, one ought to write n = a_0 + a_1 p + a_2 p^2 + ... and compute f^n as f^a_0 * (f^p)^(a_1) * ...

I just repeated the timing test from that thread, and as of 2016 it is still possible to do much better than what is implemented by explicitly splitting the exponent into base-p digits. It appears that the underlying representation of these polynomials is in Singular, so maybe the discussion should be continued here.

To make a particularly egregious example:

int p = 7;
ring rp = p, (x,y,z), dp;
poly f = (x^3 + y*z + z + y*y + x*z)^4;
poly g= f^(p^2);

should return instantaneously; instead, it takes about 10 seconds on my laptop.

Kiran

Top

 Post subject: Re: Large powers of polynomials in small characteristicPosted: Wed Apr 06, 2016 3:47 pm

Joined: Wed May 25, 2005 4:16 pm
Posts: 205
Thanks for the hint, I added the handling of this special case

Top

 Display posts from previous: All posts1 day7 days2 weeks1 month3 months6 months1 year Sort by AuthorPost timeSubject AscendingDescending
 Page 1 of 1 [ 2 posts ]

 You can post new topics in this forumYou can reply to topics in this forumYou cannot edit your posts in this forumYou cannot delete your posts in this forumYou cannot post attachments in this forum

 It is currently Tue Oct 23, 2018 9:25 am