Publication:5621733
From MaRDI portal
zbMath0217.46702MaRDI QIDQ5621733
Peter McMullen, A. A. Ball, Geoffrey C. Shephard, J. E. Reeve
Publication date: 1971
52B05: Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.)
52B11: (n)-dimensional polytopes
52-02: Research exposition (monographs, survey articles) pertaining to convex and discrete geometry
Related Items
Unnamed Item, Modélisation et optimisation numérique pour la reconstruction d'un polyèdre à partir de son image gaussienne généralisée, On Zonotopes, On counting the \(k\)-face cells of cyclic arrangements, Lower bound on testing membership to a polyhedron by algebraic decision and computation trees, Interior points of the convex hull of few points in \(\mathbb{E}^ d\), Random projections of regular simplices, Induced binary probabilities and the linear ordering polytope: A status report, Geometric and combinatorial properties of the polytope of binary choice probabilities, Cells with many facets in arrangements of hyperplanes, On integer points in polyhedra, A generalization of Dehn-Sommerville relations to simple stratified spaces, Projection algorithms for linear programming, On equivariant generalization of Dehn-Sommerville equations, Über kennzeichnende Eigenschaften von Ellipsoiden und euklidischen Räumen. III, On the inner parallel body of a convex body, Constructions for projectively unique polytopes, Incidence numbers of complexes and polytopes, Intrinsic volumes and lattice points of crosspolytopes, Equidecomposable and weakly neighborly polytopes, An upper bound theorem for rational polytopes, Combinatorics of topological posets. Homotopy complementation formulas, Eulerian 2-strata spaces, Invariant subspaces of nilpotent operators and LR-sequences, A parallel algorithm for constructing projection polyhedra, Lipschitz inverse and direct sequences, Gaps in the numbers of vertices of cubical polytopes. I, Combinatorial face enumeration in convex polytopes, McMullen's conditions and some lower bounds for general convex polytopes, Objects that cannot be taken apart with two hands, The Blaschke-Steinhardt point of a planar convex set, On the complexity of some basic problems in computational convexity. I. Containment problems, The Mayer-Vietoris and IC equations for convex polytopes, A proof of Kühnel's conjecture for \(n\geq k^ 2+3k\), Linear conditions on the number of faces of manifolds with boundary, Finite-horizon variance penalised Markov decision processes, A lower bound for randomized algebraic decision trees, Binomial mixtures: Geometric estimation of the mixing distribution, The almost simple cubical polytopes, Cyclic arrangements and Roudneff's conjecture in the space, On the Charney-Davis and Neggers-Stanley conjectures, Polynomial inequalities representing polyhedra, Hadwiger's covering conjecture and low dimensional dual cyclic polytopes, Applications of various inequalities to Minkowski geometry, On the illumination of unbounded closed convex sets, The cubical \(d\)-polytopes with fewer than 2\(^{d+1}\) vertices, Facet-reducing cuts of a convex polytope, Permuted difference cycles and triangulated sphere bundles, On the metric theory of units of cyclic cubic fields, Cyclic polytopes and oriented matroids, Spherical complexes and radial projections of polytopes, The numbers of faces of simplicial polytopes, The design of optimum component test plans in the demonstration of a series system reliability, Knots and links in spatial graphs: a survey, On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes, Polynomial bounds for probability generating functions. II
