Combinatorics of free and simplicial line arrangements
Abstract
We study the combinatorics of pseudoline arrangements in the real projective plane. Our focus lies on two classes of arrangements: simplicial arrangements and arrangements whose characteristic polynomials have only real roots. We derive inequalities involving the t-vectors of the arrangements in consideration. As application, we obtain some finiteness and classification results. Moreover, we are able to prove the Dirac Motzkin Conjecture for real pseudoline arrangements whose charateristic polynomials split over R.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.