Computing images of polynomial maps

Abstract

The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric techniques, addressing this problem. We also apply these methods to answer a question of W. Hackbusch on the non-closedness of site-independent cyclic matrix product states for infinitely many parameters.

18 pages

References in corpus (2)

• Tensor product methods and entanglement optimization for ab initio quantum chemistry
• On the toric algebra of graphical models

Cited by in corpus (2)

• Algebraic compressed sensing
• An algorithmic approach to Chevalley's Theorem on images of rational morphisms between affine varieties