Lower bounds for simplicial covers and triangulations of cubes

dc.creatorBliss, Adam
dc.creatorSu, Francis Edward
dc.date2003-10-10
dc.date.accessioned2026-07-07T06:33:36Z
dc.date.available2026-07-07T06:33:36Z
dc.descriptionWe show that the size of a minimal simplicial cover of a polytope $P$ is a lower bound for the size of a minimal triangulation of $P$, including ones with extra vertices. We then use this fact to study minimal triangulations of cubes, and we improve lower bounds for covers and triangulations in dimensions 4 through at least 12 (and possibly more dimensions as well). Important ingredients are an analysis of the number of exterior faces that a simplex in the cube can have of a specified dimension and volume, and a characterization of corner simplices in terms of their exterior faces.
dc.description17 pages, related work at http://www.math.hmc.edu/~su/papers.html
dc.identifierhttps://arxiv.org/abs/math/0310142
dc.identifierhttp://arxiv.org/abs/math/0310142
dc.identifierDiscrete Comput. Geom. 33 (2005), 669--686
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/99250
dc.subjectCombinatorics
dc.subjectMetric Geometry
dc.subject52B11 (Primary); 52B12, 52B05 (Secondary)
dc.titleLower bounds for simplicial covers and triangulations of cubes
dc.typetext

Files

Collections