Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On complements of convex polyhedra as polynomial and regular images of $\R^n$ (1212.1813v1)

Published 8 Dec 2012 in math.AG

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

We haven't generated a summary for this paper yet.