The open quadrant problem: A topological proof
From MaRDI portal
Abstract: In this work we present a new polynomial map whose image is the open quadrant . The proof of this fact involves arguments of topological nature that avoid hard computer calculations. In addition each polynomial has degree and only monomials, becoming the simplest known map solving the open quadrant problem.
Recommendations
Cited in
(6)- On the existence of Pareto solutions for polynomial vector optimization problems
- A short proof for the open quadrant problem
- Polynomial, regular and Nash images of Euclidean spaces
- On polynomial images of a closed ball
- Surjective Nash maps between semialgebraic sets
- Complements of unbounded convex polyhedra as polynomial images of \({{\mathbb{R}}}^n\)
This page was built for publication: The open quadrant problem: A topological proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2990349)