Hi Simon,
You're completely right. Actually I messed up the libraries, the __call__
method used should be the one from Mpolynomial_libsingular.
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To unsubscribe from this group and stop receiving
There is a memory leak in the evaluation of multivariable polynomials:
-C.x,y,z=GF(2)[]
-f=x^4+x*y^3+z^6
-get_memory_usage()
.1014.47265625
- for i in xrange(100):
a=f(1,0,0)
-get_memory_usage()
.1052.47265625
I think the problem is in the implementation of the __call__ method
in any characteristic.
El viernes, 9 de mayo de 2014 13:16:59 UTC+2, Gabriel Furstenheim Milerud
escribió:
I'd like to create an elliptic curve from a degree 3 polynomial without a
base point, but when I use the Jacobian method I get a division by zero
error.
This is my data:
A=GF(3^2,'c
I've read through the code and this is indeed the problem. It calls
WeierstrassForm from schemes.toric which only implements the short version.
Fernando Rodriguez Villegas has some code available for Pari/GP
http://www.ma.utexas.edu/users/villegas/cnt/cnt-frames.html in jacobians
which works
I'd like to create an elliptic curve from a degree 3 polynomial without a
base point, but when I use the Jacobian method I get a division by zero
error.
This is my data:
A=GF(3^2,'c')
S.a,b,c=A[]
gS=a^3 - a^2*b + b^3 - a^2*c - a*b*c + b^2*c + a*c^2 + b*c^2 + c^3
Jacobian(gS)
My intuition is
