Abstract

Consider arrangements of n pseudolines in the real projective plane. Let $$t_k$$tk denote the number of intersection points where exactly k pseudolines are incident. We present a new combinatorial inequality: $$\begin{aligned} t_2+1.5t_3\ge 8+\sum _{k\ge 4}(2k-7.5)t_k, \end{aligned}$$t2+1.5t3?8+?k?4(2k-7.5)tk,which holds if no more than $$n-3$$n-3 pseudolines intersect at one point. It looks similar but is unrelated to the Hirzebruch inequality for arrangements of complex lines in the complex projective plane. Based on this linear inequality, we construct lower bounds for the number of regions via n and the maximal number of (pseudo)lines passing through one point.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.