Vertex-Facet Incidences of Unbounded Polyhedra

Simple item page
dc.creatorJoswig, Michael
dc.creatorKaibel, Volker
dc.creatorPfetsch, Marc E.
dc.creatorZiegler, Guenter M.
dc.date2000-06-29
dc.date.accessioned2026-07-07T04:36:09Z
dc.date.available2026-07-07T04:36:09Z
dc.descriptionHow much of the combinatorial structure of a pointed polyhedron is contained in its vertex-facet incidences? Not too much, in general, as we demonstrate by examples. However, one can tell from the incidence data whether the polyhedron is bounded. In the case of a polyhedron that is simple and "simplicial," i.e., a d-dimensional polyhedron that has d facets through each vertex and d vertices on each facet, we derive from the structure of the vertex-facet incidence matrix that the polyhedron is necessarily bounded. In particular, this yields a characterization of those polyhedra that have circulants as vertex-facet incidence matrices.
dc.descriptionLaTeX2e, 14 pages with 4 figures
dc.identifierhttps://arxiv.org/abs/math/0006225
dc.identifierhttp://arxiv.org/abs/math/0006225
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/59500
dc.subjectCombinatorics
dc.subjectMetric Geometry
dc.subject52B05; 52B11; 06A07
dc.titleVertex-Facet Incidences of Unbounded Polyhedra
dc.typetext

Files

Collections

arXiv