Implicitisation and Parameterisation in Polynomial Functors

Blatter, Andreas; Draisma, Jan; Ventura, Emanuele (2023). Implicitisation and Parameterisation in Polynomial Functors. Foundations of computational mathematics Springer 10.1007/s10208-023-09619-6

Preview

Text s10208-023-09619-6.pdf - Published Version Available under License Creative Commons: Attribution (CC-BY). Download (544kB) | Preview

In earlier work, the second author showed that a closed subset of a polynomial functor can always be defined by finitely many polynomial equations. In follow-up work on GL_{\infty}-varieties, Bik–Draisma–Eggermont–Snowden showed, among other things, that in characteristic zero every such closed subset is the image of a morphism whose domain is the product of a finite-dimensional affine variety and a polynomial functor. In this paper, we show that both results can be made algorithmic: there exists an algorithm that takes as input a morphism into a polynomial functor and outputs finitely many equations defining the closure of the image; and an algorithm that takes as input a finite set of equations defining a closed subset of a polynomial functor and outputs a morphism whose image is that closed subset.

Interest & Impact

Downloads

18 since deposited on 20 Dec 2023
18 in the past 12 months

Citations

5 Citations in Web of Science ®
6 Citations in Scopus

Search

in Google Scholar™

Services

Actions (login required)

Edit item

Actions (login required)

Edit item