On complements of convex polyhedra as polynomial images of Rn{\mathbb R}^n

preprint2015arXivOpen access

Abstract

In this work we prove constructively that the complement Rn∖K{\mathbb R}^n\setminus{\mathcal K} of an nn-dimensional unbounded convex polyhedron K⊂Rn{\mathcal K}\subset{\mathbb R}^n and the complement Rn∖Int(K){\mathbb R}^n\setminus{\rm Int}({\mathcal K}) of its interior are polynomial images of Rn{\mathbb R}^n whenever K{\mathcal K} does not disconnect Rn{\mathbb R}^n. The compact case and the case of convex polyhedra of small dimension were approached by the authors in previous works. Consequently, the results of this article provide a full answer to the representation as polynomial images of Euclidean spaces of complements of convex polyhedra and its interiors. The techniques here are more sophisticated than those corresponding to the compact case and require a rational separation result for certain type of (non-compact) semialgebraic sets, that has interest by its own.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.