The Dirac--Goodman--Pollack Conjecture
Combinatorics
2022-08-30 v3
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.
Cite
@article{arxiv.2204.06101,
title = {The Dirac--Goodman--Pollack Conjecture},
author = {Adrian Dumitrescu},
journal= {arXiv preprint arXiv:2204.06101},
year = {2022}
}
Comments
14 pages, 4 figures