Coding and counting arrangements of pseudolines

DOI10.1007/s00454-011-9366-4zbMath1228.52014OpenAlexW2080742098MaRDI 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

enumerationcombinatorial geometrycutpathpseudoline

Mathematics Subject Classification ID

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

Related Items (15)

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

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

This page was built for publication: Coding and counting arrangements of pseudolines