 | 1 | initial version |
Suppose we have some multivariate polynomials $f, g_1, g_2, g_3 \in F[x,y,z, ... ]$ where $F$ is some field, e.g $\mathbb{Q}$ or some finite field. I'm asking for an algorithm that "simplifies" $f$ assuming $g_1 = g_2 = g_3 = 0$. That is, I want to find a simple/short representative of $f$ in the quotient ring $F[x,y,z,...]/\langle g_1, g_2, g_3 \rangle$. I suspect it has something to do with Grobner bases but I haven't found anything concrete yet.
Than
Suppose we have some multivariate polynomials $f, g_1, g_2, g_3 \in F[x,y,z, ... ]$ where $F$ is some field, e.g $\mathbb{Q}$ or some finite field. I'm asking for an algorithm that "simplifies" $f$ assuming $g_1 = g_2 = g_3 = 0$. That is, I want to find a simple/short representative of $f$ in the quotient ring $F[x,y,z,...]/\langle g_1, g_2, g_3 \rangle$. I suspect it has something to do with Grobner bases but I haven't found anything concrete yet.
ThanThank you.
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.
