A short proof for the open quadrant problem
From MaRDI portal
Publication:321277
DOI10.1016/j.jsc.2016.08.004zbMath1372.14052arXiv1502.07866OpenAlexW2259888491MaRDI QIDQ321277
Publication date: 13 October 2016
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.07866
Semialgebraic sets and related spaces (14P10) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (6)
On Nash images of Euclidean spaces ⋮ On polynomial images of a closed ball ⋮ Surjective Nash maps between semialgebraic sets ⋮ Polynomial, regular and Nash images of Euclidean spaces ⋮ On the existence of Pareto solutions for polynomial vector optimization problems ⋮ Complements of unbounded convex polyhedra as polynomial images of \({{\mathbb{R}}}^n\)
Uses Software
Cites Work
- Multivariate polynomial decomposition
- Polynomial images of \(\mathbb{R}^n\)
- A rational function decomposition algorithm by near-separated polynomials
- On convex polygons and their complements as images of regular and polynomial maps of \(\mathbb R^2\)
- On the one dimensional polynomial and regular images of \(\mathbb R^n\)
- Polynomial and regular images of \(\mathbb R^n\)
- On the set of points at infinity of a polynomial image of \(\mathbb R^n\)
- On the complements of 3-dimensional convex polyhedra as polynomial images of ℝ3
- On Complements of Convex Polyhedra as Polynomial and Regular Images of ℝn
- On convex polyhedra as regular images of ℝ n
- On the number of multiplications necessary to compute certain functions
- Polynomial decomposition algorithms
- Unnamed Item
- Unnamed Item
This page was built for publication: A short proof for the open quadrant problem
