|
This article is cited in 2 scientific papers (total in 2 papers)
On Simplicial Partitions of Polytopes
A. A. Glazyrin M. V. Lomonosov Moscow State University
Abstract:
We prove some general properties of prismoids, i.e., polytopes all of whose vertices lie in two parallel planes. On the basis of these properties, we obtain a nontrivial lower bound for the number of simplices in a triangulation of the $n$-dimensional cube.
Keywords:
prismoid, $(0,1)$-polytope, simplicial partition, triangulation, minimal triangulation, inextensible set.
Received: 15.06.2006 Revised: 23.10.2008
Citation:
A. A. Glazyrin, “On Simplicial Partitions of Polytopes”, Mat. Zametki, 85:6 (2009), 840–848; Math. Notes, 85:6 (2009), 799–806
Linking options:
https://www.mathnet.ru/eng/mzm3889https://doi.org/10.4213/mzm3889 https://www.mathnet.ru/eng/mzm/v85/i6/p840
|
Statistics & downloads: |
Abstract page: | 440 | Full-text PDF : | 231 | References: | 48 | First page: | 13 |
|