Post new topic Reply to topic  [ 3 posts ] 
Author Message
 Post subject: is there a way to support huge exponent, like x^(2^256)
PostPosted: Wed Oct 27, 2010 11:56 pm 

Joined: Thu Jul 09, 2009 7:28 am
Posts: 24
What I found was Singular can only support at most x^(2^30) (on a 64-bit machine).
Now I am wondering whether there is a way to support large exponent, like x^(2^256).
Or whether Singular has a plan to support large exponent.

Thanks in advance.
Gepo


Report this post
Top
 Profile  
Reply with quote  
 Post subject: Re: is there a way to support huge exponent, like x^(2^256)
PostPosted: Thu Oct 28, 2010 9:26 am 

Joined: Wed May 25, 2005 4:16 pm
Posts: 275
The limit for exponent can be extended up to the size that of the type long,
i.e. up to 2^63 on 64-bit machine - this will be available in one
of the next versions.
There no plans to go to larger exponent as this would require a change of
the data structures for polynomials.

Hans Schoenemann


Report this post
Top
 Profile  
Reply with quote  
 Post subject: Re: is there a way to support huge exponent, like x^(2^256)
PostPosted: Wed Nov 10, 2010 2:08 pm 

Joined: Tue Jun 23, 2009 10:33 pm
Posts: 51
Location: Kaiserslautern
Dear gepo,

you may simulate huge exponents per hand using additional dummy variables as follows:

Code:
ring R = 0, (x100, x50, x), lp; // ADD dummy variables for multiples
qring Q = groebner( ideal( x100 - x50^2, x50 - x^50 ) ); // Relations between x^n and x_n
poly H = x100 * x100 - x50 + x; // bigger exponents
H; // x100^2-x50+x
NF(H, std(0)); // or use subst to get expression in 'x'
x^200-x^50+x


I hope this helps,
Oleksandr


Report this post
Top
 Profile  
Reply with quote  
Display posts from previous:  Sort by  
Post new topic Reply to topic  [ 3 posts ] 

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

It is currently Fri May 13, 2022 11:07 am
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group