Pages that link to "Item:Q1086843"
From MaRDI portal
The following pages link to Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\) (Q1086843):
Displayed 21 items.
- Probabilistic communication complexity (Q579927) (← links)
- Bier spheres and barycentric subdivision (Q598461) (← links)
- A pseudo-algorithmic separation of lines from pseudo-lines (Q674001) (← links)
- Many triangulated 3-spheres (Q707439) (← links)
- Reconstructing graphs from cut-set sizes (Q909677) (← links)
- Exterior algebra and projection of polytopes (Q912187) (← links)
- Bezout theorem for Nash functions (Q916744) (← links)
- Uniform oriented matroids without the isotopy property (Q1121895) (← links)
- Bounding the number of connected components of a real algebraic set (Q1174716) (← links)
- The complexity of point configurations (Q1175788) (← links)
- Some provably hard crossing number problems (Q1176321) (← links)
- On counting triangulations in \(d\) dimensions (Q1314531) (← links)
- Inclusion-exclusion complexes for pseudodisk collections (Q1355193) (← links)
- On the number of simplicial complexes in \(\mathbb{R}^ d\) (Q1370935) (← links)
- On the coordinatization of oriented matroids (Q1820787) (← links)
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains (Q1900971) (← links)
- There are asymptotically far fewer polytopes than we thought (Q3709425) (← links)
- On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes (Q3971327) (← links)
- Crossing numbers of random graphs (Q4798172) (← links)
- Kalai's squeezed 3-spheres are polytopal (Q5899354) (← links)
- Crossing patterns of segments (Q5953378) (← links)