Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
From MaRDI portal
Publication:1086843
DOI10.1007/BF02187696zbMath0609.52004MaRDI QIDQ1086843
Jacob E. Goodman, Richard Pollack
Publication date: 1986
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/186385
points in general positioncombinatorially distinct labeled simplicial polytopesorder types of simple numbered configurations
Other designs, configurations (05B30) Inequalities and extremum problems involving convexity in convex geometry (52A40) Configuration theorems in linear incidence geometry (51A20) Polytopes and polyhedra (52Bxx)
Related Items
Lower bounds on the length of monotone paths in arrangements, There are asymptotically far fewer polytopes than we thought, Crossing numbers of random graphs, Inclusion-exclusion complexes for pseudodisk collections, Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains, On the generalized lower bound conjecture for polytopes and spheres, On the number of simplicial complexes in \(\mathbb{R}^ d\), Bier spheres and barycentric subdivision, Uniform oriented matroids without the isotopy property, Realization spaces of arrangements of convex bodies, Many neighborly polytopes and oriented matroids, Nonpolytopal nonsimplicial lattice spheres with nonnegative toric \(g\)-vector, Universal sequences of lines in \(\mathbb{R}^d\), Maximum rectilinear crossing number of uniform hypergraphs, Many neighborly spheres, Positive Plücker tree certificates for non-realizability, Face numbers: the upper bound side of the story, Ham-sandwich cuts for abstract order types, A FLAG VECTOR OF A 3‐SPHERE THAT IS NOT THE FLAG VECTOR OF A 4‐POLYTOPE, Reconstructing graphs from cut-set sizes, Neighborly inscribed polytopes and Delaunay triangulations, A farewell to Ricky Pollack, Exterior algebra and projection of polytopes, Bezout theorem for Nash functions, Bounding the number of connected components of a real algebraic set, The complexity of point configurations, Some provably hard crossing number problems, On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes, A pseudo-algorithmic separation of lines from pseudo-lines, On the number of order types in integer grids of small size, Kalai's squeezed 3-spheres are polytopal, Many triangulated 3-spheres, Polytopal Bier spheres and Kantorovich-Rubinstein polytopes of weighted cycles, An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions, Probabilistic communication complexity, Crossing patterns of segments, Induced Ramsey-type results and binary predicates for point sets, Graphs with Large Obstacle Numbers, Arrangements of pseudocircles: on circularizability, The number of disk graphs, Clique-width of point configurations, On the coordinatization of oriented matroids, The complexity of optimization on grids, Subquadratic Encodings for Point Configurations, On counting triangulations in \(d\) dimensions, THE ERDŐS–SZEKERES PROBLEM FOR NON‐CROSSING CONVEX SETS, Arrangements of approaching pseudo-lines, Many triangulated odd-dimensional spheres
Cites Work
- Unnamed Item
- Unnamed Item
- Semispaces of configurations, cell complexes of arrangements
- On the number of reduced decompositions of elements of Coxeter groups
- Neighborly polytopes
- On the combinatorial classification of nondegenerate configurations in the plane
- Oriented matroids
- Orientability of matroids
- Multidimensional Sorting
- Lower bounds for algebraic decision trees
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- On the Number of Vertices of a Convex Polytope
- On the Betti Numbers of Real Varieties
