On complements of convex polyhedra as polynomial images of Rn

Abstract

In this work we prove constructively that the complement Rn K of an n-dimensional unbounded convex polyhedron K⊂ Rn and the complement Rn Int( K) of its interior are polynomial images of Rn whenever K does not disconnect Rn. 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…