arXiv · 1801.00827
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.
Explore related subjects
Keep this discovery
Corey Harris, Mateusz Michałek, Emre Can Sertöz. 2018-01-02. Computing images of polynomial maps. https://doi.org/10.1007/s10444-019-09715-8
Cite the original work for its findings. Save a collection to share your selection of sources.