# Reducing a Set of Polynomial Equations to Minimal Variables and Equations

I have a list of polynomial equations equal to zero, lets call it

equations = [f1 == 0, f2 == 0, ..., fn ==0]

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!

See also this stackoverflow post.

kcrisman ( 2013-06-03 15:27:07 -0500 )editI think that anyone answering this would need more details. Can you post something on e.g. pastebin?

kcrisman ( 2013-06-03 15:27:52 -0500 )edit