A Szemerédi-Trotter type theorem in \(\mathbb R^4\) (Q745661)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A Szemerédi-Trotter type theorem in \(\mathbb R^4\)
scientific article

    Statements

    A Szemerédi-Trotter type theorem in \(\mathbb R^4\) (English)
    0 references
    0 references
    14 October 2015
    0 references
    Szemerédi and Trotter determined the asymptotic bound for the number of incidences that can occur between a collection of \(m\) points and \(n\) lines in the plane. This solved a problem posed by Erdős. The main results obtained by the author of this paper are the theorem below and a number of corollaries, which may be considered to be of Szemerédi-Trotter type. Given a collection of points \(\mathcal{P}\subset\mathbb{R}^4\) and a collection of surfaces \(\mathcal{S}\) in \(\mathbb{R}^4\), define the set of incidences between \(\mathcal{P}\) and \(\mathcal{S}\) by \(\mathcal{I}(\mathcal{P},\mathcal{S})=\{(p,S) \in \mathcal{P} \times \mathcal{S}: p \in S \}\). Theorem. Let \(\mathcal{P} \subset \mathbb{R}^4\) be a collection of \(m\) points. Let \(\mathcal{S}\) be a \(C_0\)-good collection of pseudoflats with \(k\) degrees of freedom. Let \(n=|\mathcal{S}| \) and suppose \(m \leq n^{(2k+2)/3k}\). Let \(I\subset \mathcal{I}(\mathcal{P},\mathcal{S})\) be a good collection of incidences. Then \[ |I| \leq C_1(m^{\frac{k}{2k-1}}n^{\frac{2k-2}{2k-1}}+m+n). \] The constant \(C_1\) depends only on \(C_0\) and \(k\).
    0 references
    0 references
    0 references
    0 references
    0 references
    incidence geometry
    0 references
    combinatorial geometry
    0 references
    polynomial partitioning
    0 references
    crossing lemma
    0 references
    0 references
    0 references
    0 references