The Dirac--Goodman--Pollack Conjecture
Adrian Dumitrescu

TL;DR
This paper confirms the Dirac--Goodman--Pollack conjecture in allowable sequences, establishing a specific bound and advancing understanding of geometric configurations through combinatorial methods.
Contribution
The paper proves the Dirac--Goodman--Pollack conjecture with a concrete bound, providing new insights into allowable sequences and their geometric implications.
Findings
Confirmed the conjecture with bound c=1/845
Analyzed properties of allowable sequences
Discussed related geometric problems
Abstract
In one of their seminal articles on allowable sequences, Goodman and Pollack gave combinatorial generalizations for three problems in discrete geometry, one of which being the Dirac conjecture. According to this conjecture, any set of noncollinear points in the plane has a point incident to at least connecting lines determined by the set. The notion of allowable sequences of permutations provides a natural combinatorial setting for analyzing these problems. Within this formalism, the conjectured generalization reads as follows: \emph{Any nontrivial allowable -sequence has a local sequence whose half-period is at least .} The conjecture is confirmed here with a concrete bound . Several related problems are discussed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Mathematics and Applications · Computational Geometry and Mesh Generation
