Computing images of polynomial maps (Q2305553)

It is well known that the image of a polynomial map is a constructible set. One may compute its closure in computer algebra systems however, a procedure for computing the constructible set itself is not known. In this paper, authors provide an algorithm, based on algebro-geometric techniques, addressing this problem. Afterwards, they apply the results presented in this paper to answer a question of W. Hackbusch on the non-closedness of site-independent cyclic matrix product states for infinitely many parameters.