Computing images of polynomial maps (Q2305553)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing images of polynomial maps |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing images of polynomial maps |
scientific article |
Statements
Computing images of polynomial maps (English)
0 references
11 March 2020
0 references
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.
0 references
polynomial maps
0 references
constructible set
0 references
matrix product states
0 references
0 references
0 references
0 references
0.7256948947906494
0 references
0.713630735874176
0 references
0.7009477615356445
0 references
0.6879518628120422
0 references
0.6869348287582397
0 references
