Projection of Varieties Defined by Generic Sparse Polynomial Systems

The computation of Zariski closures of linear projections of varieties is a basic task in elimination theory. I will present a probabilistic symbolic algorithm that computes these projections to coordinate subspaces for varieties defined by generic sparse polynomial systems taking into account their support set. The complexity of the algorithm depends on combinatorial invariants associated to the supports. Based on joint work with Gabriela Jeronimo and Juan Sabia.