The maximum numbers of faces of a convex polytope
From MaRDI portal
Publication:5621734
DOI10.1112/S0025579300002850zbMath0217.46703WikidataQ56806763 ScholiaQ56806763MaRDI QIDQ5621734
Publication date: 1970
Published in: Mathematika (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11)
Related Items
Computing and analyzing recoverable supports for sparse reconstruction, Voronoi diagrams and arrangements, About \(f\)-vectors of inscribed simplicial polytopes, McMullen's conditions and some lower bounds for general convex polytopes, A decomposition of 2-weak vertex-packing polytopes, A shellable poset that is not lexicographically shellable, Local convex hulls for a special class of integer multicommodity flow problems, On the complexity of some basic problems in computational convexity. I. Containment problems, Many triangulated spheres, Largest \(j\)-simplices in \(n\)-polytopes, The maximum number of faces of the Minkowski sum of two convex polytopes, Evolution, games theory and polyhedra, How good are convex hull algorithms?, The upper bound theorem for polytopes: An easy proof of its asymptotic version, Variance asymptotics and scaling limits for random polytopes, An infinite family of nearly neighborly centrally symmetric 3-spheres, Konstruktionsmethoden und das kombinatorische Homöomorphieproblem für Triangulationen kompakter semilinearer Mannigfaltigkeiten. (Methods of constructions and the combinatorical homeomorphism problem for triangulations of compact semilinear manifolds), Intersection properties of boxes. I: An upper-bound theorem, Almost tight upper bounds for the single cell and zone problems in the three dimensions, On the number of irreducible points in polyhedra, Linear programming, the simplex algorithm and simple polytopes, Combinatorial redundancy detection, The unique 3-neighborly 4-manifold with few vertices, On the complexity of d-dimensional Voronoi diagrams, Visible shorelines in \({\mathbb{R}}^ d\), Many neighborly polytopes and oriented matroids, Realizability and inscribability for simplicial polytopes via nonlinear optimization, Rational associahedra and noncrossing partitions, The number of extreme points of tropical polyhedra, The flag upper bound theorem for 3- and 5-manifolds, On the combinatorial complexity of approximating polytopes, Range minima queries with respect to a random permutation, and approximate range counting, Finding largest rectangles in convex polygons, Über die bistellare Äquivalenz simplizialer Sphären und Polytope, Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls, Non-manifold surface reconstruction from high-dimensional point cloud data, Graph problems arising from parameter identification of discrete dynamical systems, Quotient polytopes of cyclic polytopes. I: Structure and characterization, A family of neighborly polytopes, On the number of faces of simplicial complexes and the purity of Frobenius, Neighborly inscribed polytopes and Delaunay triangulations, Shellings of simplicial balls and p.l. manifolds with boundary, A tight bound for the Delaunay triangulation of points on a polyhedron, Remarks on the upper bound theorem., Reduced arithmetically Gorenstein schemes and simplicial polytopes with maximal Betti numbers., A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes, Eine geometrische Interpretation einer Ringinvarianten, The number of faces of polytope pairs and unbounded polyhedra, Euler flag enumeration of Whitney stratified spaces, A new index for polytopes, Small-dimensional linear programming and convex hulls made easy, Some applications of algebra to combinatorics, Intersection properties of boxes. II: Extremal families, Weighted derivations and the cd-index, Efficient edge-skeleton computation for polytopes defined by oracles, Shelling pseudopolyhedra, The \(m=1\) amplituhedron and cyclic hyperplane arrangements, On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space, Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums, The maximum number of complementary facets of a simplicial polytope, On the linear extension complexity of regular \(n\)-gons, On the polyhedral complexity of the integer points in a hyperball, Upper bounds for the diameter and height of graphs of convex polyhedra, Positively oriented matroids are realizable, Constructing a Pareto front approximation for decision making, PAINT: Pareto front interpolation for nonlinear multiobjective optimization, Rigidity and the Alexandrov-Fenchel inequality, Some theoretical challenges in digital geometry: a perspective, The lower and upper bound problems for cubical polytopes, Support sets in exponential families and oriented matroid theory, Tropical polar cones, hypergraph transversals, and mean payoff games, Polytope pairs and their relationship to linear programming, On face numbers of manifolds with symmetry, A generalized sewing construction for polytopes, Computing Kitahara-Mizuno's bound on the number of basic feasible solutions generated with the simplex algorithm, Stellare Abänderungen und Schälbarkeit von Komplexen und Polytopen, Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints, Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints, A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes, Bistellare Äquivalenz kombinatorischer Mannigfaltigkeiten, Representation of multivariate Bernoulli distributions with a given set of specified moments, RDELA -- a Delaunay-triangulation-based, location and covariance estimator with high breakdown point, On overlays and minimization diagrams, Computing monotone disjoint paths on polytopes, Matchings and covers in hypergraphs, An upper bound theorem for rational polytopes, Output-sensitive results on convex hulls, extreme points, and related problems, Computational complexity of norm-maximization, New applications of random sampling in computational geometry, Upper bound theorems for homology manifolds, Socles of Buchsbaum modules, complexes and posets, The upper bound theorem for flag homology 5-manifolds, Probing the arrangement of hyperplanes, The lexicographic sum of Cohen-Macaulay and shellable ordered sets, A bound on local minima of arrangements that implies the upper bound theorem, A non-shellable 3-sphere, P.l. homeomorphic manifolds are equivalent by elementary shellings, A simple proof of the upper bound theorem, On simple polytopes, Cyclic arrangements and Roudneff's conjecture in the space, Scribability problems for polytopes, On the rectilinear crossing number of complete uniform hypergraphs, Scalable branching on dual decomposition of stochastic mixed-integer programming problems, Polyhedral omega: a new algorithm for solving linear Diophantine systems, A proof of Grünbaum's lower bound conjecture for general polytopes, Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces, Unnamed Item, A geometric lower bound theorem, On Linked Spatial Representations, Adaptive estimation of convex and polytopal density support, Convex hulls, oracles, and homology, Constrained random matching, PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS, Some Recent Developments in Spectrahedral Computation, On the Monotone Upper Bound Problem, A NOTE ON ORDER‐TYPE HOMOGENEOUS POINT SETS, Bounds on the complexity of halfspace intersections when the bounded faces have small dimension, Irregularities of point distributions relative to homothetic convex bodies. I, Union and glueing of a family of Cohen-Macaulay partially ordered sets, Enumerating Neighborly Polytopes and Oriented Matroids, Boundary estimation from point clouds: algorithms, guarantees and applications, On lattice point counting in \(\varDelta\)-modular polyhedra, Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions, New interpretations of the higher Stasheff-Tamari orders, Balanced Cohen-Macaulay Complexes, P.L.-spheres, convex polytopes, and stress, Signable posets and partitionable simplicial complexes, New families of highly neighborly centrally symmetric spheres, An algorithm for constructing the convex hull of a set of spheres in dimension \(d\), Estimation of level set trees using adaptive partitions, A characterization of homology manifolds with \(g_{2}\geq 2\), Qualification Conditions in Semialgebraic Programming, Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality, A new cubical \(h\)-vector, On the Number of Vertices of Random Polyhedra with a Given Number of Facets, Oriented matroid polytopes and polyhedral fans are signable, Highly neighborly centrally symmetric spheres, Characterizing face and flag vector pairs for polytopes, On Ranks of Regular Polygons, Approximating Joint Probability Distributions Given Partial Information, The Morse theory of Čech and Delaunay complexes, Computing the vertices of tropical polyhedra using directed hypergraphs, Face numbers of generalized balanced Cohen-Macaulay complexes, Monomial Tropical Cones for Multicriteria Optimization, Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs, On the number of vertices of the stochastic tensor polytope, Maximal admissible faces and asymptotic bounds for the normal surface solution space, A tree traversal algorithm for decision problems in knot theory and 3-manifold topology, Explicit constructions of centrally symmetric \(k\)-neighborly polytopes and large strictly antipodal sets, A simple algorithm for higher-order Delaunay mosaics and alpha shapes, Cohen-Macaulay rings and constructible polytopes, The Upper Bound Conjecture and Cohen-Macaulay Rings, Unnamed Item, Variance asymptotics for random polytopes in smooth convex bodies, Subpolytopes of cyclic polytopes, Cyclic polytopes and oriented matroids, Balanced shellings and moves on balanced manifolds, Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling, Rational polytopes with Ehrhart coefficients of arbitrary period, Persistent homology and the upper box dimension, Constructible complexes and recursive division of posets, Deciding nonconstructibility of 3-balls with spanning edges and interior vertices, A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector, Two Decompositions in Topological Combinatorics with Applications to Matroid Complexes, Shellable nonpure complexes and posets. II, Convex hulls of perturbed random point sets, NEIGHBORLINESS OF THE SYMMETRIC MOMENT CURVE, Empty monochromatic simplices, A centrally symmetric version of the cyclic polytope, Empty simplices of polytopes and graded Betti numbers, Optimizing the double description method for normal surface enumeration, Neighborly 4-polytopes with 9 vertices, Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism, Unnamed Item, Generating a random collection of discrete joint probability distributions subject to partial information, Ear decomposition and balanced neighborly simplicial manifolds, Moment curves and cyclic symmetry for positive Grassmannians, Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes, Persistent graphs and cyclic polytope triangulations, Unnamed Item, Unnamed Item, On the upper-bound conjecture for convex polytopes, The numbers of faces of simplicial polytopes, Nested bipartite graphs, The expected number of extreme points of a random linear program, Six Topics on Inscribable Polytopes, Eine Verallgemeinerung der Ungleichung vom arithmetischen und geometrischen Mittel, A sweep-plane algorithm for generating random tuples in simple polytopes, Shellability of posets of labeled partitions and arrangements defined by root systems, The Weber-Seifert dodecahedral space is non-Haken, Generalized adaptive partition-based method for two-stage stochastic linear programs: geometric oracle and analysis, Monotone Paths in Planar Convex Subdivisions and Polytopes, Fast multivariate log-concave density estimation, Central limit theorems for random polytopes, Knots and links in spatial graphs: a survey, Roudneff's conjecture for Lawrence oriented matroids, The toric ℎ-vectors of partially ordered sets, Simplicial neighbourly 5-polytopes with nine vertices, Random polytopes: Their definition, generation and aggregate properties, Small covers and quasitoric manifolds over neighborly polytopes, Polytopes, graphs, and complexes, NON‐EULERIAN DEHN–SOMMERVILLE RELATIONS, On the number of vertices of projective polytopes, Maximum rectilinear crossing number of uniform hypergraphs, Designing optimization problems with diverse solutions, Edge connectivity of simplicial polytopes, Transversals and colorings of simplicial spheres, The Geometry of Sparse Analysis Regularization, Graphical designs and gale duality, Learning Polytopes with Fixed Facet Directions, Shellable tilings on relative simplicial complexes and their \(h\)-vectors, Optimal nonparametric testing of missing completely at random and its connections to compatibility, Exact Quantization of Multistage Stochastic Linear Problems, Face numbers: the upper bound side of the story, On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems, On \(k\)-neighborly reorientations of oriented matroids, Schälbare Cohen-Macaulay-Komplexe und ihre Parametrisierung. (Shellable Cohen-Macaulay complexes and their parametrization), On counting the \(k\)-face cells of cyclic arrangements, Entering and leaving \(j\)-facets, Crossing-free segments and triangles in point configurations, Bregman Voronoi diagrams, Enumerating extreme points of the polytopes of stochastic tensors: an optimization approach, Almost Simplicial Polytopes: The Lower and Upper Bound Theorems, On Representer Theorems and Convex Regularization, On the no-signaling approach to quantum nonlocality, Helly-type problems, The Dehn–Sommerville relations and the Catalan matroid
Cites Work
