Computing images of polynomial maps

Loading...
Thumbnail Image
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
Date
2019-12
Major/Subject
Mcode
Degree programme
Language
en
Pages
Series
ADVANCES IN COMPUTATIONAL MATHEMATICS
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.
Description
Keywords
Constructible set, Matrix product states, Polynomial maps
Other note
Citation
Harris , C , Michałek , M & Sertöz , E C 2019 , ' Computing images of polynomial maps ' , Advances in Computational Mathematics , vol. 45 , no. 5-6 , pp. 2845–2865 . https://doi.org/10.1007/s10444-019-09715-8