Abstract
We construct a family of cubical polytypes which shows that the upper bound on the number of facets of a cubical polytope (given a fixed number of vertices) is higher than previously suspected. We also formulate a lower bound conjecture for cubical polytopes.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
E. A. Abbott,Flatland, a Romance of Many Dimensions, New York: Harper and Row, 1983.
D. W. Barnette, The minimum number of vertices of a simple polytope,Israel J. Math. 10 (1971), 121–125.
D. W. Barnette, A proof of the lower bound conjecture for convex polytopes,Pacific J. Math. 46 (1973), 349–354.
G. Blind and R. Blind, Convex Polytopes Without Triangular Faces,Israel J. Math. 71 (1990), 129–134.
P. McMullen, The maximum numbers of faces of a convex polytope,Mathematika 17 (1970), 179–184.
Rutgers University, Problems presented at the DIMACS Workshop on Polytopes and Convex Sets, 1990.
Author information
Authors and Affiliations
Additional information
This paper was researched and written while the author was a graduate student at MIT. The author was partially supported by an NSF Graduate Fellowship.
Rights and permissions
About this article
Cite this article
Jockusch, W. The lower and upper bound problems for cubical polytopes. Discrete Comput Geom 9, 159–163 (1993). https://doi.org/10.1007/BF02189315
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02189315