Computing Implicitizations of Multi-Graded Polynomial Maps

Joseph Cummings, Benjamin Hollering

In this paper, we focus on computing the kernel of a map of polynomial rings $\phi$. This core problem in symbolic computation is known as implicitization. While there are extremely e…