Coding and counting arrangements of pseudolines

DOI10.1007/s00454-011-9366-4zbMath1228.52014MaRDI QIDQ644821

Stefan Felsner, Pavel Valtr

Publication date: 7 November 2011

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-011-9366-4

zbMATH Keywords

enumeration; combinatorial geometry; cutpath; pseudoline

Mathematics Subject Classification ID

52C30: Planar arrangements of lines and pseudolines (aspects of discrete geometry)

Related Items

Subquadratic Encodings for Point Configurations, New algorithms and bounds for halving pseudolines, Improved enumeration of simple topological graphs, Ramsey numbers and monotone colorings, Cambrian acyclic domains: counting \(c\)-singletons, Many order types on integer grids of polynomial size, Constructing large peak-pit Condorcet domains, Enumeration of Gelfand-Cetlin type reduced words, Optimal reconfiguration of optimal ladder lotteries, Realization spaces of arrangements of convex bodies, THE ERDŐS–SZEKERES PROBLEM FOR NON‐CROSSING CONVEX SETS, Reconstructing Point Set Order Typesfrom Radial Orderings, The Bundled Crossing Number, Reconstructing Point Set Order Types from Radial Orderings

Cites Work

• Proof of a conjecture of Burr, Grünbaum, and Sloane
• Axioms and hulls
• On the number of arrangements of pseudolines
• Acyclic sets of linear orders
• Higher Bruhat orders and cyclic hyperplane arrangements
• Acyclic sets of linear orders via the Bruhat orders
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item