Computing Implicitizations of Multi-Graded Polynomial Maps

In this talk, we'll introduce a new method for computing the kernel of a polynomial map which is homogeneous with respect to a multigrading. We first demonstrate how to quickly compute a matrix of maximal rank for which the map has a positive multigrading. Then in each graded component we compute the minimal generators of the kernel in that multidegree with linear algebra. We have implemented our techniques in Macaulay2 and show that our implementation can compute many generators of low degree in examples where Gröbner basis techniques have failed. This includes several examples coming from phylogenetics where even a complete list of quadrics and cubics were unknown. When the multigrading refines total degree, our algorithm is embarrassingly parallel. This is joint work with Joseph Cummings.