Computing images of polynomial maps
From MaRDI portal
Publication:2305553
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.
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.
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
Cites work
- Algebraic statistical models
- Algorithms for tight spans and tropical linear spaces
- Basic Algebraic Geometry 2
- Equations for lower bounds on border rank
- Geometry of phylogenetic group-based models
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- Matrix product state representations
- Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication
- On geometry of binary symmetric models of phylogenetic trees
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- On multiplication of 2 2 matrices
- On the geometry of border rank decompositions for matrix multiplication and other tensors with symmetry
- On the geometry of tensor network states
- On the toric algebra of graphical models
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
- Tensor spaces and numerical tensor calculus
- Tensor-train decomposition
- The border rank of the multiplication of 2\times 2 matrices is seven
- The ConstructibleSetTools and ParametricSystemTools modules of the RegularChains library in Maple
- Toric Ideals of Phylogenetic Invariants
- Toric varieties in phylogenetics
Cited in
(11)- Bad projections of the PSD cone
- Uniform matrix product states from an algebraic geometer's point of view
- Complex best \(r\)-term approximations almost always exist in finite dimensions
- Typical and generic ranks in matrix completion
- Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
- Determining Integer-Valued Polynomials From Their Image
- An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties
- A Tensor Version of the Quantum Wielandt Theorem
- The Image Containment Problem and Some Classes of Polynomial Instances
- Algebraic compressed sensing
- Images of dominant endomorphisms of affine space
Describes a project that uses
Uses Software
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)
