This is the part in sage, f1,f2,f3 are 3 polynomials and I have to
reduce them by I, the ideal in the line 8. This ideal is a vanishing
ideal of some points.
R = GF(3)['x1,x2,x3,x4'];
R. = PolynomialRing(GF(3), order='degrevlex')
x1,x2,x3 = R.gens();
f1=-x1^3+x1^2*x3-x1^2+x1*x3-x1;
f2=x1^3-x1^2*x3+
Can you post the system you are working with? Or if its very large,
post a link to a file? I don't work over finite fields myself, so the
current implementation is probably very biased towards QQ. It would
help me to see a "real life" example.
Thanks,
Marshall Hampton
On Apr 6, 2:04 am, Andrea
Thank you for the answer...I have some question:
-I have gf=I.groebner_fan(); where I is a 0-dimentional ideal. Now gf
has the function gf.weight_vectors(); This returns the weight vectors
corresponding to the reduced Groebner bases. I try to call
polyedralfan() but it raises an error...maybe becau
Unfortunately I don't think this is easy to do right now.
If you have a Groebnerfan object for your ideal - lets call it G -
then you can get the associated polyhedral fan:
Gp = G.polyhedralfan()
This object has a method Gp.rays() that will give you the weight
vectors of the faces of the Groebne
Hi Andrea,
On Thu, Apr 1, 2010 at 6:05 PM, Andrea Gobbi wrote:
> Good morning.
> I'm using sage for my thesis, and I have a question. How can I use
> the function grobnerfan(ideal)? I have to reduce a polynomial
> f(x_1,,x_n) using all possible grobner basis in F_p. This is too
> long, and
