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

In this work we prove constructively that the complement $\R^n\setminus\pol$ of a convex polyhedron $\pol\subset\R^n$ and the complement $\R^n\setminus\Int(\pol)$ of its interior are regular images of $\R^n$. If $\pol$ is moreover bounded, we can assure that $\R^n\setminus\pol$ and $\R^n\setminus\In...

Descripción completa

Detalles Bibliográficos
Autores: Fernando Galván, José Francisco, Ueno, Carlos
Tipo de recurso: artículo
Fecha de publicación:2014
País:España
Institución:Universidad Complutense de Madrid (UCM)
Repositorio:Docta Complutense
Idioma:inglés
OAI Identifier:oai:docta.ucm.es:20.500.14352/33886
Acceso en línea:https://hdl.handle.net/20.500.14352/33886
Access Level:acceso abierto
Palabra clave:512
Polynomial and regular maps and images
convex polyhedra
first and second trimming positions
trimming maps
optimization
Positivstellens¨atze
Geometria algebraica
1201.01 Geometría Algebraica
Descripción
Sumario:In this work we prove constructively that the complement $\R^n\setminus\pol$ of a convex polyhedron $\pol\subset\R^n$ and the complement $\R^n\setminus\Int(\pol)$ of its interior are regular images of $\R^n$. If $\pol$ is moreover bounded, we can assure that $\R^n\setminus\pol$ and $\R^n\setminus\Int(\pol)$ are also polynomial images of $\R^n$. 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.