On the number of rich lines in high dimensional real vector spaces (Q309656): Difference between revisions

Using as main technique the Polynomial Ham Sandwich Theorem [\textit{L. Guth} and \textit{N. H. Katz}, Ann. Math. (2) 181, No. 1, 155--190 (2015; Zbl 1310.52019)] the authors show: ``Let \(P\) be a set of \(n\) points in \(\mathbb R^d\) and let \(L\) be a set of lines so that each line contains at least \(r\) points of \(P\). There is a constant \(K\), dependent only on \(d\), so that if \[ |L|\geq\,K{n^2}/r^{d+1} \] then there exists a hypersurface of degree at most \(r/4\) containing at least \(4n^2/r^{d+1}\) lines of \(L\).'' By the theorem above the authors prove a conjecture due to \textit{Z. Dvir} and \textit{S. Gopi} [``On the number of rich lines in truly high dimensional sets'', in: 31st international symposium on computational geometry, (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs) 34. 584--598 (2015)] but over \(\mathbb R\) rather than over \(\mathbb C\).