Work

Computing images of polynomial maps

Year: 2019

Type: article

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.

Source: Advances in Computational Mathematics

DOI: 10.1007/s10444-019-09715-8

Authors: Corey Harris, Mateusz Michałek, Emre Can Sertöz

Institutions: Max Planck Institute for Mathematics in the Sciences, Institute of Mathematics, Aalto University, Polish Academy of Sciences

Language: English

Topic: Polynomial and algebraic computation

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $2,690

Funders: Max-Planck-Gesellschaft, Narodowe Centrum Nauki, Uniwersytet Warszawski