I have a list of polynomial equations equal to zero, lets call it
I know that each polynomial $f_{i}$ is a function of $n^2$ variables where $n$ is determined by input from the user. Is there any way that I can reduce this system of polynomial equations in Python (or with a Sage package) to a minimal number of polynomials and variables? I tried looking up Grobner basis (http://www.sagemath.org/doc/constructions/polynomials.html#grobner-bases) but it does not seem to be working for what I want as it doesn't check out correctly with the analytical math I have been doing. Thanks! |

Asked: **Jun 03 '13**

Seen: **49 times**

Last updated: **Jun 03 '13**

powered by ASKBOT version 0.7.22

Copyright Sage, 2010. Some rights reserved under creative commons license.

See also this stackoverflow post.

kcrisman (Jun 03 '13)I think that anyone answering this would need more details. Can you post something on e.g. pastebin?

kcrisman (Jun 03 '13)