On the public citation graph
Upper bounds for configurations and polytopes inR d
0 signed · 118 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0095-8956(78)90080-1openalex-snapshot
Orientability of matroids
inferredcites →https://doi.org/10.1016/0097-3165(80)90011-4openalex-snapshot
On the combinatorial classification of nondegenerate configurations in the plane
inferredcites →https://doi.org/10.1016/0097-3165(84)90050-5openalex-snapshot
Semispaces of configurations, cell complexes of arrangements
inferredcites →https://doi.org/10.1016/0196-6774(82)90002-5openalex-snapshot
Lower bounds for algebraic decision trees
inferredcites →https://doi.org/10.1016/s0195-6698(84)80039-6openalex-snapshot
On the Number of Reduced Decompositions of Elements of Coxeter Groups
inferredcites →https://doi.org/10.1090/memo/0154openalex-snapshot
Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
inferredcites →https://doi.org/10.1090/s0002-9939-1964-0161339-9openalex-snapshot
On the Betti Numbers of Real Varieties
inferredcites →https://doi.org/10.4153/cjm-1964-067-6openalex-snapshot
On the Number of Vertices of a Convex Polytope
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jcta.1996.0072openalex-snapshot
Bounding the Number of Geometric Permutations Induced byk-Transversals
inferred← citeshttps://doi.org/10.1007/0-387-29929-7_9openalex-snapshot
Problems on Points in General Position
inferred← citeshttps://doi.org/10.1007/3-540-54891-2_6openalex-snapshot
On the morphology of polytopes in ℝd
inferred← citeshttps://doi.org/10.1007/978-1-4612-0963-8_3openalex-snapshot
Polygons, Polyhedra, and Polytopes
inferred← citeshttps://doi.org/10.1007/978-3-030-04414-5_39openalex-snapshot
Arrangements of Pseudocircles: On Circularizability
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_5openalex-snapshot
Clique-Width of Point Configurations
inferred← citeshttps://doi.org/10.1007/978-3-540-24595-7_5openalex-snapshot
How Many Ways Can One Draw a Graph?
inferred← citeshttps://doi.org/10.1007/978-3-642-16926-7_27openalex-snapshot
Graphs with Large Obstacle Numbers
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_4openalex-snapshot
Epsilon-Nets and Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-3-642-58043-7_6openalex-snapshot
Allowable Sequences and Order Types in Discrete and Computational Geometry
inferred← citeshttps://doi.org/10.1007/978-3-662-57413-3_9openalex-snapshot
Erdős–Szekeres Theorems for Families of Convex Sets
inferred← citeshttps://doi.org/10.1007/bf00155727openalex-snapshot
There are uncountably many universal topological planes
inferred← citeshttps://doi.org/10.1007/bf02187702openalex-snapshot
On the coordinatization of oriented matroids
inferred← citeshttps://doi.org/10.1007/bf02187717openalex-snapshot
Uniform oriented matroids without the isotopy property
inferred← citeshttps://doi.org/10.1007/bf02187792openalex-snapshot
Exterior algebra and projections of polytopes
inferred← citeshttps://doi.org/10.1007/bf02570710openalex-snapshot
Visibility graphs of staircase polygons and the weak Bruhat order, I: From visibility graphs to maximal chains
inferred← citeshttps://doi.org/10.1007/bf02574679openalex-snapshot
Lower bounds on the length of monotone paths in arrangements
inferred← citeshttps://doi.org/10.1007/bf02574685openalex-snapshot
Bounding the number of connected components of a real algebraic set
inferred← citeshttps://doi.org/10.1007/bf02574701openalex-snapshot
Some provably hard crossing number problems
inferred← citeshttps://doi.org/10.1007/pl00009295openalex-snapshot
Inclusion-exclusion complexes for pseudodisk collections
inferred← citeshttps://doi.org/10.1007/pl00009443openalex-snapshot
On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets
inferred← citeshttps://doi.org/10.1007/s00208-004-0594-2openalex-snapshot
Many triangulated 3-spheres
inferred← citeshttps://doi.org/10.1007/s00208-015-1232-xopenalex-snapshot
Many triangulated odd-dimensional spheres
inferred← citeshttps://doi.org/10.1007/s00208-023-02652-4openalex-snapshot
Many regular triangulations and many polytopes
inferred← citeshttps://doi.org/10.1007/s00373-023-02711-2openalex-snapshot
Maximum Rectilinear Crossing Number of Uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00453-016-0246-4openalex-snapshot
Ham-Sandwich Cuts for Abstract Order Types
inferred← citeshttps://doi.org/10.1007/s00453-019-00587-4openalex-snapshot
The Complexity of Optimization on Grids
inferred← citeshttps://doi.org/10.1007/s00454-001-0074-3openalex-snapshot
Kalai’s Squeezed 3-Spheres Are Polytopal
inferred← citeshttps://doi.org/10.1007/s00454-005-1187-xopenalex-snapshot
Grid Orientations, (d,d + 2)-Polytopes, and Arrangements of Pseudolines
inferred← citeshttps://doi.org/10.1007/s00454-012-9449-xopenalex-snapshot
Nonpolytopal Nonsimplicial Lattice Spheres with Nonnegative Toric g-Vector
inferred← citeshttps://doi.org/10.1007/s00454-013-9544-7openalex-snapshot
Many Neighborly Polytopes and Oriented Matroids
inferred← citeshttps://doi.org/10.1007/s00454-017-9869-8openalex-snapshot
Realization Spaces of Arrangements of Convex Bodies
inferred← citeshttps://doi.org/10.1007/s00454-017-9944-1openalex-snapshot
Multi-degree Bounds on the Betti Numbers of Real Varieties and Semi-algebraic Sets and Applications
inferred← citeshttps://doi.org/10.1007/s00454-019-00151-5openalex-snapshot
Polytopal Bier Spheres and Kantorovich–Rubinstein Polytopes of Weighted Cycles
inferred← citeshttps://doi.org/10.1007/s00454-020-00237-5openalex-snapshot
A Farewell to Ricky Pollack
inferred← citeshttps://doi.org/10.1007/s00454-021-00361-wopenalex-snapshot
Arrangements of Approaching Pseudo-Lines
inferred← citeshttps://doi.org/10.1007/s00454-023-00521-0openalex-snapshot
Implicit Representation of Sparse Hereditary Families
inferred← citeshttps://doi.org/10.1007/s00454-024-00681-7openalex-snapshot
Many Equiprojective Polytopes
inferred← citeshttps://doi.org/10.1007/s00454-024-00687-1openalex-snapshot
The Complexity of Order Type Isomorphism
inferred← citeshttps://doi.org/10.1007/s00454-025-00733-6openalex-snapshot
Subword Complexes and Kalai’s Conjecture on Reconstruction of Spheres
inferred← citeshttps://doi.org/10.1007/s004540010043openalex-snapshot
Kalai's Squeezed Spheres Are Shellable
inferred← citeshttps://doi.org/10.1007/s00493-006-0032-zopenalex-snapshot
How Many Ways Can One Draw A Graph?
inferred← citeshttps://doi.org/10.1007/s00493-009-2357-xopenalex-snapshot
An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions
inferred← citeshttps://doi.org/10.1007/s11511-013-0093-yopenalex-snapshot
On the generalized lower bound conjecture for polytopes and spheres
inferred← citeshttps://doi.org/10.1007/s11856-023-2504-xopenalex-snapshot
Universal sequences of lines in ℝd
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90012-4openalex-snapshot
Reconstructing graphs from cut-set sizes
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00201-9openalex-snapshot
A pseudo-algorithmic separation of lines from pseudo-lines
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90046-2openalex-snapshot
Probabilistic communication complexity
inferred← citeshttps://doi.org/10.1016/0022-4049(89)90080-7openalex-snapshot
Bezout theorem for nash functions
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90068-8openalex-snapshot
The complexity of point configurations
inferred← citeshttps://doi.org/10.1016/0925-7721(93)90005-qopenalex-snapshot
On counting triangulations in d dimensions
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50012-6openalex-snapshot
Computational Geometry
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50017-1openalex-snapshot
Helly, Radon, and Carathéodory Type Theorems
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50019-5openalex-snapshot
Combinatorial Aspects of Convex Polytopes
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50025-0openalex-snapshot
Geometric Algorithms
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50020-8openalex-snapshot
10.1016/b978-044488002-4/50020-8
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50034-8openalex-snapshot
10.1016/b978-044488002-4/50034-8
inferred← citeshttps://doi.org/10.1016/j.comgeo.2020.101730openalex-snapshot
On the number of order types in integer grids of small size
inferred← citeshttps://doi.org/10.1016/j.jcta.2003.12.002openalex-snapshot
Bier spheres and barycentric subdivision
inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00007-2openalex-snapshot
On the number of simplicial complexes in Rd
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00400-7openalex-snapshot
Kalai's squeezed 3-spheres are polytopal
inferred← citeshttps://doi.org/10.1017/9781009701259.006openalex-snapshot
Betti Number Bounds, Applications and Algorithms
inferred← citeshttps://doi.org/10.1017/9781108539180openalex-snapshot
Forbidden Configurations in Discrete Geometry
inferred← citeshttps://doi.org/10.1080/10586458.2021.1994487openalex-snapshot
Positive Plücker tree certificates for non-realizability
inferred← citeshttps://doi.org/10.1090/pspum/110/02015openalex-snapshot
Neighborly spheres and transversal numbers
inferred← citeshttps://doi.org/10.1090/s0002-9947-1991-0994170-3openalex-snapshot
On the Topology and Geometric Construction of Oriented Matroids and Convex Polytopes
inferred← citeshttps://doi.org/10.1090/s0273-0979-1986-15415-7openalex-snapshot
There are asymptotically far fewer polytopes than we thought
inferred← citeshttps://doi.org/10.1090/s0894-0347-1990-1046181-2openalex-snapshot
The intrinsic spread of a configuration in 𝑅^{𝑑}
inferred← citeshttps://doi.org/10.1109/sfcs.1985.30openalex-snapshot
Geometrical realization of set systems and probabilistic communication complexity
inferred← citeshttps://doi.org/10.1109/tpami.2019.2939530openalex-snapshot
Bound and Conquer: Improving Triangulation by Enforcing Consistency
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22453.xopenalex-snapshot
New Bounds on Higher Dimensional Configurations and Polytopesa
inferred← citeshttps://doi.org/10.1112/s0025579300013875openalex-snapshot
The number of polytopes, configurations and real matroids
inferred← citeshttps://doi.org/10.1112/s0025579314000072openalex-snapshot
THE ERDŐS–SZEKERES PROBLEM FOR NON‐CROSSING CONVEX SETS
inferred← citeshttps://doi.org/10.1112/s0025579316000267openalex-snapshot
A FLAG VECTOR OF A 3‐SPHERE THAT IS NOT THE FLAG VECTOR OF A 4‐POLYTOPE
inferred← citeshttps://doi.org/10.1137/1.9781611977073.10openalex-snapshot
Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees
inferred← citeshttps://doi.org/10.1137/23m1585088openalex-snapshot
Bounding and Computing Obstacle Numbers of Graphs
inferred← citeshttps://doi.org/10.1137/24m1682361openalex-snapshot
Transversal Numbers of Simplicial Polytopes, Spheres, and Pure Complexes
inferred← citeshttps://doi.org/10.1145/177424.177624openalex-snapshot
Bounding the number of geometric permutations induced by k-transversals
inferred← citeshttps://doi.org/10.1145/237814.237988openalex-snapshot
On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
inferred← citeshttps://doi.org/10.1145/2543581.2543589openalex-snapshot
Unsolved problems in visibility graphs of points, segments, and polygons
inferred← citeshttps://doi.org/10.1145/3591357openalex-snapshot
Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees
inferred← citeshttps://doi.org/10.1145/73007.73046openalex-snapshot
Coordinate representation of order types requires exponential storage
inferred← citeshttps://doi.org/10.1515/advgeom-2015-0045openalex-snapshot
Neighborly inscribed polytopes and delaunay triangulations
inferred← citeshttps://doi.org/10.20382/jocg.v6i1a5openalex-snapshot
On characterizing terrain visibility graphs
inferred← citeshttps://doi.org/10.2307/1990931openalex-snapshot
The Intrinsic Spread of a Configuration in R d
inferred← citeshttps://doi.org/10.37236/2380openalex-snapshot
Lower Bounds on the Obstacle Number of Graphs
inferred← citeshttps://doi.org/10.4230/lipics.socg.2016.52openalex-snapshot
A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations
inferred← citeshttps://doi.org/10.4230/lipics.socg.2020.49openalex-snapshot
Convex Hulls of Random Order Types
inferred← citeshttps://doi.org/10.46298/dmtcs.3032openalex-snapshot
Constructing neighborly polytopes and oriented matroids
inferred← citeshttps://doi.org/10.48550/arxiv.2110.12474openalex-snapshot
Universal sequences of lines in $\mathbb R^d$
inferred← citeshttps://doi.org/10.48550/arxiv.math/0506372openalex-snapshot
Triangulated Manifolds with Few Vertices: Combinatorial Manifolds
inferred← citeshttps://doi.org/10.70675/a351859az0723z49a4zab6az34bdcb3accc9openalex-snapshot
Geometric realizations using regular subdivisions : construction of many polytopes, sweep polytopes, s-permutahedra
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.