Implicitisation and Parameterisation in Polynomial Functors

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 ∞ -varieties, Bik–Draisma–Eggermont–Snowden showed, among other things, that in characteristic zero every such closed subset is...

Full description

Saved in:

Bibliographic Details
Published in:	Foundations of computational mathematics Vol. 24; no. 5; pp. 1567 - 1593
Main Authors:	Blatter, Andreas, Draisma, Jan, Ventura, Emanuele
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2024 Springer Nature B.V
Subjects:	Algorithms Applications of Mathematics Computer Science Economics Linear and Multilinear Algebras Math Applications in Computer Science Mathematics Mathematics and Statistics Matrix Theory Numerical Analysis Parameterization Polynomials 14M99 13P99 Polynomial functor Elimination Parameterisation 20G05 15A69 Schur functors
ISSN:	1615-3375, 1615-3383
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!