Computing images of polynomial maps

Corey Harris, Mateusz Michałek, and Emre Sertöz

Contact the author: Please use for correspondence this email.
Submission date: 04. Jan. 2018
published in: Advances in computational mathematics, 45 (2019) 5/6, p. 2845-2865 
DOI number (of the published article): 10.1007/s10444-019-09715-8
Bibtex
MSC-Numbers: 14Q15, 68U05, 15A69
Keywords and phrases: image of an algebraic variety, matrix product state
Link to arXiv: See the arXiv entry of this preprint.

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.