Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 16 Dec 2014 in math.AG | (1412.5107v2)

Abstract: In this work we prove constructively that the complement ${\mathbb R}n\setminus{\mathcal K}$ of an $n$-dimensional unbounded convex polyhedron ${\mathcal K}\subset{\mathbb R}n$ and the complement ${\mathbb R}n\setminus{\rm Int}({\mathcal K})$ of its interior are polynomial images of ${\mathbb R}n$ whenever ${\mathcal K}$ does not disconnect ${\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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.