2021-06-23 00:08:48 +0200 | received badge | ● Notable Question (source) |

2016-12-21 07:05:56 +0200 | received badge | ● Popular Question (source) |

2013-06-07 15:26:34 +0200 | received badge | ● Nice Question (source) |

2013-06-04 10:59:40 +0200 | received badge | ● Student (source) |

2013-06-03 19:23:57 +0200 | asked a question | Reducing a Set of Polynomial Equations to Minimal Variables and Equations 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/construct...) 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! |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.