On the Sylvester-Gallai and the orchard problem for pseudoline arrangements

DOI10.1007/S10998-017-0224-XMaRDI QIDQ1714972zbMATH OpenOpenAlexFDO

Authors Jürgen Bokowski, Piotr Pokora

Publication date 1 February 2019

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1607.05864

zbMATH Keywords

line arrangementsOrchard problempseudoline arrangementsSylvester's problem

Mathematics Subject Classification ID

Relations with arrangements of hyperplanes (32S22) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Abstract: We study a non-trivial extreme case of the orchard problem for $12$ pseudolines and we provide a complete classification of pseudoline arrangements having $19$ triple points and $9$ double points. We have also classified those that can be realized with straight lines. They include new examples different from the known example of B"or"oczky. Since Melchior's inequality also holds for arrangements of pseudolines, we are able to deduce that some combinatorial point-line configurations cannot be realized using pseudolines. In particular, this gives a negative answer to one of Gr"unbaum's problems. We formulate some open problems which involve our new examples of line arrangements.

Review text

A pseudoline in the real projective plane is a simple closed curve that does not cut the real projective plane into two components. A pseudoline arrangement in the real projective plane is a finite set of pseudolines such that has exactly one point in common, where they cross. The paper studies multiplicities of points in pseudoline arrangements. The paper classifies arrangements of 12 pseudolines with 19 triple points and 9 double points, and further classifies among them those that can be realized with lines.

Recommendations

• scientific article; zbMATH DE number 1182898
• The maximum number of triangles in arrangements of pseudolines
• Straight line arrangements in the real projective plane
• Real and complex supersolvable line arrangements in the projective plane
• On the number of arrangements of pseudolines

Cited in

(9)

• Containment problem and combinatorics
• A Sylvester-Gallai result for concurrent lines in the complex plane
• scientific article; zbMATH DE number 5004294 (Why is no real title available?)
• A pseudoline counterexample to the strong Dirac conjecture
• Klein's arrangements of lines and conics
• The generalized Sylvester's and orchard problems via discriminantal arrangement
• The Dirac-Goodman-Pollack conjecture
• On some operators acting on line arrangements and their dynamics
• Sylvester-Gallai for arrangements of subspaces

This page was built for publication: On the Sylvester-Gallai and the orchard problem for pseudoline arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1714972)