Algorithm for finding generators of an ideal

Question

Let $k$ be a field, and $f:k[x_1,\ldots,x_n]\to k[y_1,\ldots,y_m]$ a $k$-algebra homomorphism. Given $r_1,\ldots,r_k\in k[y_1,\ldots,y_m]$, is there an algorithm for producing a finite generating set for the ideal $f^{-1}((r_1,\ldots,r_k))$?

I wonder if there is even a reasonable algorithm for finding generators of $f^{-1}(0)$. — Thomas Andrews, Jul 18 '13 at 16:42

score 0 · Answer 1 · edited Aug 04 '13 at 18:06

0

The answer is yes. The question is asking to compute the kernel of

$$f : k[x_1, \dots, x_n] \rightarrow S$$

where $S$ is some quotient of a polynomial ring. Macaulay2 can calculate such a kernel.

edited Aug 04 '13 at 18:06

answered Jul 19 '13 at 00:27

RghtHndSd

7,715

Algorithm for finding generators of an ideal

1 Answers1