An algorithmic approach to Chevalley's Theorem on images of rational morphisms between affine varieties

Abstract

The goal of this paper is to introduce a new constructive geometric proof of the affine version of Chevalley's Theorem. This proof is algorithmic and a verbatim implementation resulted in an efficient code for computing the constructible image of rational maps between affine varieties. Our approach extends the known descriptions of uniform matrix product states to $\mathrm{uMPS}(2,2,5)$

arXiv commentMore elaborate comparison to other approaches (Section 5)

References in corpus (6)

• An Axiomatic Setup for Algorithmic Homological Algebra and an Alternative Approach to Localization
• A method to compute Segre classes of subschemes of projective space
• Computing images of polynomial maps
• Linear systems over localizations of rings
• Elimination via saturation
• Algorithmic Thomas Decomposition of Algebraic and Differential Systems

Cited by in corpus (3)

• Algebraic compressed sensing
• Computing the nonfree locus of the moduli space of arrangements and Terao's freeness conjecture
• Sets of Special Subvarieties of Bounded Degree