Computing images of polynomial maps

DOI10.1007/S10444-019-09715-8zbMATH Open1436.14099arXiv1801.00827OpenAlexW3099532981MaRDI QIDQ2305553FDOQ2305553

Authors: Corey Harris, Mateusz Michalek, Emre Can Sertöz 

Publication date: 11 March 2020

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1801.00827

Recommendations

• An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
• Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
• Compactifications of rational maps, and the implicit equations of their images
• On the image of a noncommutative polynomial.
• Computing the Equations of a Variety

zbMATH Keywords

polynomial mapsconstructible setmatrix product states

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects of higher-dimensional varieties (14Q15)

Cites Work

• On the toric algebra of graphical models
• Tensor-train decomposition
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• Algorithms for tight spans and tropical linear spaces
• Tensor spaces and numerical tensor calculus
• Title not available (Why is that?)
• On multiplication of 2 \(\times\) 2 matrices
• Title not available (Why is that?)
• The ConstructibleSetTools and ParametricSystemTools modules of the RegularChains library in Maple
• Toric Ideals of Phylogenetic Invariants
• On geometry of binary symmetric models of phylogenetic trees
• Toric varieties in phylogenetics
• Geometry of phylogenetic group-based models
• Matrix product state representations
• Basic Algebraic Geometry 2
• Algebraic statistical models
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
• The border rank of the multiplication of $2\times 2$ matrices is seven
• On the geometry of tensor network states
• Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication
• Equations for lower bounds on border rank
• On the geometry of border rank decompositions for matrix multiplication and other tensors with symmetry

Cited In (10)

• Typical and generic ranks in matrix completion
• The Image Containment Problem and Some Classes of Polynomial Instances
• Complex best \(r\)-term approximations almost always exist in finite dimensions
• An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
• Bad projections of the PSD cone
• Determining Integer-Valued Polynomials From Their Image
• A Tensor Version of the Quantum Wielandt Theorem
• Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
• Algebraic compressed sensing
• Uniform matrix product states from an algebraic geometer's point of view

Uses Software

• Macaulay2
• Maple
• RegularChains
• ConstructibleSetTools
• ParametricSystemTools

This page was built for publication: Computing images of polynomial maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2305553)