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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. A. De Loera, Computing Minimal and Maximal Triangulations of Convex Polytopes, Manuscript (Institut für Theoretische Informatik, Zürich, 1999).
G. M. Ziegler, “Lectures on 0/1-polytopes,” in Polytopes — Combinatorics and Computation, DMV Sem., Oberwolfach, 1997 (Birkhäuser-Verlag, Basel, 2000), Vol. 29, pp. 1–41.
S. N. Bernstein, Collected Works, Vol. I: The Constructive Theory of Functions [1905–1930] (Izdat. Akad. Nauk SSSR, Moscow, 1952) [in Russian].
Author information
Authors and Affiliations
Additional information
Original Russian Text © A. A. Glazyrin, 2009, published in Matematicheskie Zametki, 2009, Vol. 85, No. 6, pp. 840–848.
Rights and permissions
About this article
Cite this article
Glazyrin, A.A. On simplicial partitions of polytopes. Math Notes 85, 799–806 (2009). https://doi.org/10.1134/S0001434609050228
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0001434609050228