scientific article; zbMATH DE number 3345859

From MaRDI portal
Publication:5621733

zbMath0217.46702MaRDI QIDQ5621733

A. A. Ball, J. E. Reeve, Peter McMullen, Geoffrey C. Shephard

Publication date: 1971


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Lipschitz inverse and direct sequencesCan you cover your shadows?Gaps in the numbers of vertices of cubical polytopes. ISpherical complexes and nonprojective toric varietiesCharacterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). II: Sufficiency of Eckhoff's conditionsCombinatorial face enumeration in convex polytopesMcMullen's conditions and some lower bounds for general convex polytopesObjects that cannot be taken apart with two handsThe Blaschke-Steinhardt point of a planar convex setDetermining a matroid polytope by non-Radon partitionsPolarity and point extensions in oriented matroidsOn the complexity of some basic problems in computational convexity. I. Containment problemsThe Mayer-Vietoris and IC equations for convex polytopesThe cubical \(d\)-polytopes with fewer than 2\(^{d+1}\) verticesBalanced subdivision and enumeration in balanced spheresFacet-reducing cuts of a convex polytopePermuted difference cycles and triangulated sphere bundlesA proof of Kühnel's conjecture for \(n\geq k^ 2+3k\)Totally positive matrices and cyclic polytopesLinear conditions on the number of faces of manifolds with boundaryDiameter-extremal subsets of spheresThe face lattice of hyperplane arrangementsThe unique 3-neighborly 4-manifold with few verticesFinite-horizon variance penalised Markov decision processesOn the metric theory of units of cyclic cubic fieldsA lower bound for randomized algebraic decision treesThe number of faces of a simplicial convex polytopeZur optimalen Approximation konvexer Hyperflächen durch PolyederCohen-Macaulay ordered setsTheory of conesQuotient polytopes of cyclic polytopes. I: Structure and characterizationOn the number of faces of simplicial complexes and the purity of FrobeniusExterior algebra and projection of polytopesAn improved vertex enumeration algorithmLipschitz-Killing curvatures of angular partially ordered setsOn the order dimension of convex polytopes(d-3)-Skelette nicht-polytopaler (d-1)-SphärenA proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopesEine geometrische Interpretation einer RinginvariantenThe number of faces of polytope pairs and unbounded polyhedraA generalization of Caratheodory's theoremCombinatorial properties of incompatible systems of linear inequalities and polyhedraApproximation of convex bodies by polytopesDie Anzahl der primitiven Polytope im \(R^ n \)mit 2n-2 FacettenInterior points of the convex hull of few points in \(\mathbb{E}^ d\)Random projections of regular simplicesInduced binary probabilities and the linear ordering polytope: A status reportGeometric and combinatorial properties of the polytope of binary choice probabilitiesCells with many facets in arrangements of hyperplanesLower bound on testing membership to a polyhedron by algebraic decision and computation treesOn integer points in polyhedraA generalization of Dehn-Sommerville relations to simple stratified spacesProjection algorithms for linear programmingOn equivariant generalization of Dehn-Sommerville equationsÜber kennzeichnende Eigenschaften von Ellipsoiden und euklidischen Räumen. IIIOn the inner parallel body of a convex bodyOn the Charney-Davis and Neggers-Stanley conjecturesConstructions for projectively unique polytopesPolynomial inequalities representing polyhedraIncidence numbers of complexes and polytopesRigidity and the lower bound theorem. INeighborly 6-polytopes with 10 verticesAlmost cyclic polytopesA new basis of polytopesNeighborly polytopes and oriented matroidsFlag numbers and floating bodiesIntersecting all edges of convex polytopes by planesConvex surfaces whose geodesics are planarCurvature measures of convex bodiesMannigfaltigkeiten im 2-Skelett konvexer PolytopeÜber stellare Äquivalenz konvexer PolytopeHadwiger's covering conjecture and low dimensional dual cyclic polytopesApplications of various inequalities to Minkowski geometryOn the illumination of unbounded closed convex setsA combinatorial analysis of topological dissectionsIntrinsic volumes and lattice points of crosspolytopesEquidecomposable and weakly neighborly polytopesAn upper bound theorem for rational polytopesProperties of a method for polyhedral approximation of the feasible criterion set in convex multiobjective problemsCombinatorics of topological posets. Homotopy complementation formulasIntersection patterns of convex setsSome problems on polyhedraThe extended f-vectors of 4-polytopesEulerian 2-strata spacesThe associahedron and triangulations of the \(n\)-gonBinomial mixtures: Geometric estimation of the mixing distributionThe almost simple cubical polytopesOn \(k\)-stacked polytopesInvariant subspaces of nilpotent operators and LR-sequencesLinear Diophantine equations and local cohomologyConstruction theorems for polytopesLattice points in lattice polytopesThe complexity of incremental convex hull algorithms in \(R^ d\)Characterization of f-vectors of families of convex sets in \({\mathbb{R}}^ d\). I: Necessity of Eckhoff's conditionsA problem of McMullen on the projective equivalences of polytopesA parallel algorithm for constructing projection polyhedraMittlere Schattengrenzenlänge konvexer KörperA simple proof of the upper bound theoremCyclic arrangements and Roudneff's conjecture in the spaceTriangle-free polytopes with few facetsUnnamed ItemArrangements in higher dimensions: Voronoi diagrams, motion planning, and other applicationsThe Lower Bound Theorem for $d$-Polytopes with $2{d}+1$ VerticesConvex polytopes without triangular facesThe Caratheodory number for the k-coreOn low-dimensional faces that high-dimensional polytopes must haveKlein polyhedra and lattices with positive norm minimaThe Extreme Projections of the Regular SimplexMultidimensional frontier visualization based on optimization methods using parallel computationsMethod for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinalityUnnamed ItemDecompositions of Ehrhart \(h^*\)-polynomials for rational polytopesMinkowski summands of cubesBadly approximable matrices and Diophantine exponentsUnnamed ItemTHREE CHARACTERIZATIONS OF STRICT COHERENCE ON INFINITE-VALUED EVENTSOn Neighbourly TriangulationsSchälbare Cohen-Macaulay-Komplexe und ihre Parametrisierung. (Shellable Cohen-Macaulay complexes and their parametrization)Cyclic polytopes and oriented matroidsOn the Golod property of Stanley-Reisner ringsOn ZonotopesOn the Topology and Geometric Construction of Oriented Matroids and Convex PolytopesSTRICT COHERENCE ON MANY-VALUED EVENTSDivisions of Space by ParallelsAnalysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.Polynomial bounds for probability generating functions. IIOn counting the \(k\)-face cells of cyclic arrangementsTwo combinatorial properties of a class of simplicial polytopesSome applications of the Frobenius in characteristic 0Sufficiency of McMullen’s conditions for 𝑓-vectors of simplicial polytopesShellable complexes from multicomplexesMinkowski summands of cubesModélisation et optimisation numérique pour la reconstruction d'un polyèdre à partir de son image gaussienne généraliséeRandom Gale diagrams and neighborly polytopes in high dimensionsA Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3DContinuous Maps from Spheres Converging to Boundaries of Convex HullsOn Canonical Modules of Toric Face RingsLeast distance methods for the scheme of polytopesSpherical complexes and radial projections of polytopesThe numbers of faces of simplicial polytopesGenerating Combinatorial Complexes of Polyhedral TypeThe design of optimum component test plans in the demonstration of a series system reliabilityBounds on the Reliability Polynomial for Shellable Independence SystemsThe 𝑐𝑑-index: A surveyKnots and links in spatial graphs: a surveyThe Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic