The number of polytopes, configurations and real matroids
From MaRDI portal
Publication:3718727
DOI10.1112/S0025579300013875zbMath0591.05014MaRDI QIDQ3718727
Publication date: 1986
Published in: Mathematika (Search for Journal in Brave)
Combinatorial aspects of finite geometries (05B25) Combinatorial aspects of matroids and geometric lattices (05B35) Polytopes and polyhedra (52Bxx)
Related Items
There are asymptotically far fewer polytopes than we thought, Crossing numbers of random graphs, Many triangulated spheres, Universal 3-dimensional visibility representations for graphs, Many neighborly polytopes and oriented matroids, Nonpolytopal nonsimplicial lattice spheres with nonnegative toric \(g\)-vector, Universal sequences of lines in \(\mathbb{R}^d\), Many neighborly spheres, On the extension complexity of polytopes separating subsets of the Boolean cube, Positive Plücker tree certificates for non-realizability, Face numbers: the upper bound side of the story, Neighborly inscribed polytopes and Delaunay triangulations, On locally constructible spheres and balls, The complexity of point configurations, On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes, Geometry and the simplex: results, questions and ideas, Induced Ramsey-type results and binary predicates for point sets, Graphs with Large Obstacle Numbers, The number of disk graphs, Not all graphs are segment \(T\)-graphs, Six Topics on Inscribable Polytopes, Subquadratic Encodings for Point Configurations, Many triangulated odd-dimensional spheres
Cites Work
- The complete enumeration of the 4-polytopes and 3-spheres with eight vertices
- Neighborly polytopes
- The asymptotic number of geometries
- Multidimensional Sorting
- A new branch of enumerative graph theory
- The Asymptotic Number of Convex Polyhedra
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- On the Number of Vertices of a Convex Polytope
- An enumeration of simplicial 4-polytopes with 8 vertices
- On the Betti Numbers of Real Varieties
