On 0-1 polytopes with many facets
From MaRDI portal
Publication:5945246
DOI10.1006/aima.2001.1991zbMath0988.52014OpenAlexW2033029553MaRDI QIDQ5945246
Publication date: 10 July 2002
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/23636296016642e32f86625a4419cbbd6719a646
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Computational aspects related to convexity (52B55)
Related Items
Doubly random polytopes ⋮ Extremal edge polytopes ⋮ Expansion of random 0/1 polytopes ⋮ On the extension complexity of polytopes separating subsets of the Boolean cube ⋮ Random polytopes obtained by matrices with heavy-tailed entries ⋮ The convex hull of random points on the boundary of a simple polytope ⋮ Smallest singular value of random matrices and geometry of random polytopes ⋮ What is known about unit cubes ⋮ A Large Deviations Approach to the Geometry of Random Polytopes ⋮ Revlex-initial 0/1-polytopes ⋮ On the convex hull of projective planes ⋮ How to recycle your facets ⋮ Threshold for the volume spanned by random points with independent coordinates ⋮ Equivalence classes of full-dimensional 0/1-polytopes with many vertices ⋮ Approximation of convex sets by polytopes ⋮ Stability properties of neighbourly random polytopes ⋮ Threshold phenomena for high-dimensional random polytopes ⋮ On Vertices and Facets of Combinatorial 2-Level Polytopes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastical approximation of convex bodies
- Computing the volume is difficult
- Gelfand numbers of operators with values in a Hilbert space
- On the solution of traveling salesman problems
- Extremal properties of \(0/1\)-polytopes
- Upper bounds on the maximal number of facets of 0/1-polytopes
- The Caratheodory number for the k-core
- Volumes Spanned by Random Points in the Hypercube
- Geometry of cuts and metrics