Computing images of polynomial maps
Algebraic Geometry
2019-10-16 v1
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.
Cite
@article{arxiv.1801.00827,
title = {Computing images of polynomial maps},
author = {Corey Harris and Mateusz Michałek and Emre Can Sertöz},
journal= {arXiv preprint arXiv:1801.00827},
year = {2019}
}
Comments
18 pages