Abstract
Consider arrangements of n pseudolines in the real projective plane. Let \(t_k\) denote the number of intersection points where exactly k pseudolines are incident. We present a new combinatorial inequality:
which holds if no more than \(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.
Similar content being viewed by others
References
Csima, J., Sawyer, E.T.: There exist \(\frac{6n}{13}\) ordinary points. Discrete Comput. Geom. 9, 187–202 (1993)
Csima, J., Sawyer, E.T.: The \(\frac{6n}{13}\) theorem revisited. In: Graph Theory, Combinatorics, Algorithms and Applications, pp. 235–249. Wiley, New York (1995)
Dirac, G.A.: Collinearity properties of sets of points. Q. J. Math. Oxford Ser. (2) 2, 221–227 (1951)
Erdős, P., Purdy, G.B.: Some combinatorial problems in the plane. J. Comb. Theory Ser. A 25, 205–210 (1978)
Erdős, P., Purdy, G.B.: Extremal problems in combinatorial geometry. In: Handbook of Combinatorics, Vol. I, pp. 809–874. Elsevier, Amsterdam (1995)
Green, B., Tao, T.: On sets defining few ordinary lines. Discrete Comput. Geom. 50(2), 409–468 (2013)
Grünbaum, B.: Arrangements and Spreads. AMS, Providence, RI (1972)
Hirzebruch, F.: Singularities of algebraic surfaces and characteristic numbers. Contemp. Math. 58, 141–155 (1986)
Martinov, N.: Classification of arrangements by the number of their cells. Discrete Comput. Geom. 9(1), 39–46 (1993)
Melchior, E.: Über Vielseite der projektiven Ebene. Dtsch. Math. 5, 461–475 (1940)
Nilakantan, N.: Extremal problems related to the Sylvester–Gallai theorem. In: Combinatorial and Computational Geometry, pp. 479–494. MSRI, Cambridge University Press. Cambridge (2005)
Shnurnikov, I.N.: Into how many regions do \(n\) lines divide the plane if at most \(n-k\) of them are concurrent? Mosc. Univ. Math. Bull. 65(5), 208–212 (2010)
Sylvester, J.J.: Mathematical question 2571. Educational Times (1868)
Sylvester, J.J.: Mathematical question 11851. Educational Times (1893)
Acknowledgments
I am grateful to the late V. I. Arnold and to A. B. Skopenkov for their interest in this work. I am deeply grateful to the referees and E. G. Puniskij for improvements to the structure and language of the manuscript.
Author information
Authors and Affiliations
Corresponding author
Additional information
Editor in Charge: Herbert Edelsbrunner
Rights and permissions
About this article
Cite this article
Shnurnikov, I.N. A \(t_k\) Inequality for Arrangements of Pseudolines. Discrete Comput Geom 55, 284–295 (2016). https://doi.org/10.1007/s00454-015-9744-4
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-015-9744-4