Papers
Topics
Authors
Recent
Search
2000 character limit reached

On complements of convex polyhedra as polynomial and regular images of $\R^n$

Published 8 Dec 2012 in math.AG | (1212.1813v1)

Abstract: In this work we prove constructively that the complement $\Rn\setminus\pol$ of a convex polyhedron $\pol\subset\Rn$ and the complement $\Rn\setminus\Int(\pol)$ of its interior are regular images of $\Rn$. If $\pol$ is moreover bounded, we can assure that $\Rn\setminus\pol$ and $\Rn\setminus\Int(\pol)$ are also polynomial images of $\Rn$. The construction of such regular and polynomial maps is done by double induction on the number of \em facets \em (faces of maximal dimension) and the dimension of $\pol$; the careful placing (\em first \em and \em second trimming positions\em) of the involved convex polyhedra which appear in each inductive step has interest by its own and it is the crucial part of our technique.

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.