The Dirac--Goodman--Pollack conjecture for pseudolines

About 4 years old · traced to

Let L\mathcal L be a nontrivial arrangement of nn pseudolines, and let r(L)r(\mathcal L) be the maximum number of crossing points, or vertices of the arrangement, lying on a pseudoline in L\mathcal L.

Dirac--Goodman--Pollack conjecture. There is a constant c>0c>0 such that

r(L)≥cn.r(\mathcal L) \geq c n.

This is the pseudoline-arrangement formulation of the Dirac problem and is also described in terms of allowable sequences. In the abstract, the paper states that the conjecture is confirmed with the concrete bound c=1/845c=1/845.

References

Primary source

Adrian Dumitrescu, “The Dirac–Goodman–Pollack Conjecture”, arXiv:2204.06101 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.