The upper bound theorem for polytopes: An easy proof of its asymptotic version
From MaRDI portal
(Redirected from Publication:1900993)
Recommendations
- An Upper Bound Theorem for Polytope Pairs
- An upper bound theorem for rational polytopes
- An upper bound theorem concerning lattice polytopes
- scientific article; zbMATH DE number 7203478
- Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
- An asymptotically improved upper bound on the diameter of polyhedra
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- A proof of Grünbaum's lower bound conjecture for general polytopes
- Lower bound theorems for general polytopes
- A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes
Cites work
Cited in
(27)- scientific article; zbMATH DE number 7203478 (Why is no real title available?)
- Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
- How the upper bound conjecture was proved
- Variance-based simplex stochastic collocation with model order reduction for high-dimensional systems
- McMullen's conditions and some lower bounds for general convex polytopes
- Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations
- Output-sensitive algorithms for enumerating the extreme nondominated points of multiobjective combinatorial optimization problems
- Polytopes with few vertices and few facets
- Classification using proximity catch digraphs
- A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector
- The Morse theory of Čech and Delaunay complexes
- The minimum convex container of two convex polytopes under translations
- A proof of Grünbaum's lower bound conjecture for general polytopes
- Ready, set, go! The Voronoi diagram of moving points that start from a line
- Almost Simplicial Polytopes: The Lower and Upper Bound Theorems
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
- Qualification Conditions in Semialgebraic Programming
- On the Monotone Upper Bound Problem
- An upper bound on the shortness exponent of inscribable polytopes
- Relative persistent homology
- Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls
- Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls
- Exact Quantization of Multistage Stochastic Linear Problems
- Note on the complexity of the mixed-integer hull of a polyhedron
- PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS
- An Upper Bound Theorem for Polytope Pairs
This page was built for publication: The upper bound theorem for polytopes: An easy proof of its asymptotic version
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900993)
