Semispaces of configurations, cell complexes of arrangements
From MaRDI portal
Recommendations
- CELLULAR COMPLEXES AS STRUCTURED SEMI-SIMPLICIAL SETS
- Cell complexities in hyperplane arrangements
- Combinatorial cell complexes and Poincaré duality
- On configuration spaces and simplicial complexes
- scientific article; zbMATH DE number 1017097
- Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry
- Combinatorics of simplicial cell complexes and torus actions
- Cells and n-fold hyperspaces
- scientific article; zbMATH DE number 4190722
- The semigroup of combinatorial configurations
Cites work
- 2N noncollinear points determine at least 2N directions
- A theorem of ordered duality
- Helly-type theorems for pseudoline arrangments in P^ 2.
- scientific article; zbMATH DE number 3925697 (Why is no real title available?)
- scientific article; zbMATH DE number 3779340 (Why is no real title available?)
- scientific article; zbMATH DE number 3544865 (Why is no real title available?)
- scientific article; zbMATH DE number 3394958 (Why is no real title available?)
- Multidimensional Sorting
- On the combinatorial classification of nondegenerate configurations in the plane
- On the number of k-subsets of a set of n points in the plane
- On the number of line separations of a finite set in the plane
- On the number of reduced decompositions of elements of Coxeter groups
- Orientability of matroids
- Oriented matroids
- Proof of a conjecture of Burr, Grünbaum, and Sloane
- Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolines
- Sur les matroides orientes de rang 3 et les arrangements de pseudodroites dans le plan projectif réel
- Teilungen der Ebenen durch Geraden oder topologische Geraden
- Three points do not determine a (pseudo-) plane
Cited in
(54)- On the number of k-subsets of a set of n points in the plane
- On the number of reduced decompositions of elements of Coxeter groups
- Few slopes without collinearity
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- On the combinatorial classification of nondegenerate configurations in the plane
- The complexity of point configurations
- Some provably hard crossing number problems
- Classification of arrangements by the number of their cells
- On representing contexts in line arrangements
- Une axiomatisation au premier ordre des arrangements de pseudodroites euclidiennes. (A first-order axiomatisation of arrangements of Euclidean pseudolines.)
- Simultaneous dominance representation of multiple posets
- The vertex-edge visibility graph of a polygon
- Drawing the Horton set in an integer grid of minimum size
- Order on order types
- Ramsey numbers and monotone colorings
- Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains
- A two-dimensional topological representation theorem for matroid polytopes of rank 4
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
- Arrangements of approaching pseudo-lines
- Tukey depth histograms
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- Bisecting three classes of lines
- Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\)
- Valid orderings of real hyperplane arrangements
- Linearly independent split systems
- Extreme point and halving edge search in abstract order types
- Realization spaces of arrangements of convex bodies
- Acyclic sets of linear orders via the Bruhat orders
- Non-stretchable pseudo-visibility graphs
- The Erdős-Szekeres problem for non-crossing convex sets
- Reconstructing point set order types from radial orderings
- Reconstructing Point Set Order Types from Radial Orderings
- scientific article; zbMATH DE number 3925697 (Why is no real title available?)
- LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies
- Reprint of: Extreme point and halving edge search in abstract order types
- Subquadratic encodings for point configurations
- Totally normal cellular stratified spaces and applications to the configuration space of graphs
- Geometry and generation of a new graph planarity game
- An optimal algorithm for reconstructing point set order types from radial orderings
- Reconstruction of the orientation class of an oriented matroid
- New algorithms and bounds for halving pseudolines
- Sweeps, arrangements and signotopes
- On the Folkman-Lawrence topological representation theorem for oriented matroids of rank 3
- Direction-critical configurations in noncentral general position
- The complexity of order type isomorphism
- Orientation of convex sets
- A structure theorem for pseudo-segments and its applications
- Everywhere unbalanced configurations
- A structure theorem for pseudosegments and its applications
- Simplicial arrangements with up to 27 lines
- Orientation of good covers
- On the reducibility of a certain type of rank 3 uniform oriented matroid by a point
- On degree sequences and eccentricities in pseudoline arrangement graphs
- An extended lower bound on the number of( k)-edges to generalized configurations of points and the pseudolinear crossing number of K_n
This page was built for publication: Semispaces of configurations, cell complexes of arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801058)
