A short proof for the open quadrant problem

DOI10.1016/J.JSC.2016.08.004MaRDI QIDQ321277zbMATH OpenOpenAlexFDO

Authors José F. Fernando, Carlos Ueno

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, http://eprints.ucm.es/40540/7/21.pdf

zbMATH Keywords

minimum total degreenon-scalar complexityopen quadrantpolynomial maps and images

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Semialgebraic sets and related spaces (14P10)

Abstract: In 2003 it was proved that the open quadrant $x>0,y>0$ of ${mathbbR}^2$ is a polynomial image of ${mathbbR}^2$. This result was the origin of an ulterior more systematic study of polynomial images of Euclidean spaces. In this article we provide a short proof of the previous fact that does not involve computer calculations, in contrast with the original one. The strategy here is to represent the open quadrant as the image of a polynomial map that can be expressed as the composition of three simple polynomial maps whose images can be easily understood.

Recommendations

• The open quadrant problem: A topological proof
• scientific article; zbMATH DE number 2038981
• A problem on generalized quadrangles
• Proof of the Erdős-Faudree conjecture on quadrilaterals
• Publication:3491763
• A Short Proof of Cauchy's Polygonal Number Theorem
• A short geometric proof of a conjecture of Fulton
• scientific article; zbMATH DE number 3975188
• scientific article; zbMATH DE number 1949111

Cites work

• scientific article; zbMATH DE number 4029737 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• A rational function decomposition algorithm by near-separated polynomials
• Multivariate polynomial decomposition
• On complements of convex polyhedra as polynomial and regular images of \(\mathbb{R}^{n}\)
• On convex polygons and their complements as images of regular and polynomial maps of \(\mathbb R^2\)
• On convex polyhedra as regular images of \(\mathbb R^{n}\)
• On the complements of 3-dimensional convex polyhedra as polynomial images of \(\mathbb{R}^{3}\)
• On the number of multiplications necessary to compute certain functions
• On the one dimensional polynomial and regular images of \(\mathbb R^n\)
• On the set of points at infinity of a polynomial image of \(\mathbb R^n\)
• Polynomial and regular images of \(\mathbb R^n\)
• Polynomial decomposition algorithms
• Polynomial images of \(\mathbb{R}^n\)

Cited in

(7)

• On the existence of Pareto solutions for polynomial vector optimization problems
• The open quadrant problem: A topological proof
• On Nash images of Euclidean spaces
• 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\)

Describes a project that uses

Uses Software

• Maple

This page was built for publication: A short proof for the open quadrant problem

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