Semispaces of configurations, cell complexes of arrangements

DOI10.1016/0097-3165(84)90050-5zbMath0551.05002OpenAlexW2035440108WikidataQ56815621 ScholiaQ56815621MaRDI QIDQ801058

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(84)90050-5

zbMATH Keywords

allowable sequence of permutations arrangements of lines numbered configurations of points

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05) Combinatorial aspects of finite geometries (05B25) Research exposition (monographs, survey articles) pertaining to geometry (51-02) Linear incidence geometry (51A99)

Related Items

Few slopes without collinearity, Drawing the Horton set in an integer grid of minimum size, On degree sequences and eccentricities in pseudoline arrangement graphs, Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\), Linearly independent split systems, Visibility graphs of staircase polygons and the weak Bruhat order. I: From visibility graphs to maximal chains, An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings, Order on order types, Simultaneous dominance representation of multiple posets, Extreme point and halving edge search in abstract order types, Tukey depth histograms, Realization spaces of arrangements of convex bodies, LR characterization of chirotopes of finite planar families of pairwise disjoint convex bodies, Reconstructing Point Set Order Typesfrom Radial Orderings, The vertex-edge visibility graph of a polygon, Reprint of: Extreme point and halving edge search in abstract order types, On the combinatorial classification of nondegenerate configurations in the plane, Ham-sandwich cuts for abstract order types, From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices, Ramsey numbers and monotone colorings, Unnamed Item, Reconstructing Point Set Order Types from Radial Orderings, The complexity of point configurations, Some provably hard crossing number problems, Bisecting three classes of lines, A two-dimensional topological representation theorem for matroid polytopes of rank 4, Acyclic sets of linear orders via the Bruhat orders, An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\), Sweeps, arrangements and signotopes, Crossing numbers and combinatorial characterization of monotone drawings of \(K_n\), New algorithms and bounds for halving pseudolines, Non-stretchable pseudo-visibility graphs, On the Folkman-Lawrence topological representation theorem for oriented matroids of rank 3, Simplicial arrangements with up to 27 lines, Induced Ramsey-type results and binary predicates for point sets, Reconstruction of the orientation class of an oriented matroid, Geometry and Generation of a New Graph Planarity Game, Une axiomatisation au premier ordre des arrangements de pseudodroites euclidiennes. (A first-order axiomatisation of arrangements of Euclidean pseudolines.), Subquadratic Encodings for Point Configurations, On the number of k-subsets of a set of n points in the plane, Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model, Valid orderings of real hyperplane arrangements, THE ERDŐS–SZEKERES PROBLEM FOR NON‐CROSSING CONVEX SETS, On the number of reduced decompositions of elements of Coxeter groups, Arrangements of approaching pseudo-lines

Cites Work