The Szemerédi-Trotter theorem in the complex plane (Q276440): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the lattice property of the plane and some problems of Dirac, Motzkin and Erdős in combinatorial geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial complexity bounds for arrangements of curves and spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of many cells in arrangements of planes and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem on polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear combinatorics. I: Concurrency---an algebraic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur Riemannschen Geometrie in Grassmannschen Mannigfaltigkeiten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the crossing lemma by finding more crossings in sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repeated angles in the plane and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Incidences Between Points and Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4657590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs drawn with few crossings per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE NUMBER OF SUMS AND PRODUCTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Numbers and Hard Erdős Problems in Discrete Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems in discrete geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial distinction between the Euclidean and projective planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: DIFFERENTIAL GEOMETRY OF GRASSMANN MANIFOLDS / rank
 
Normal rank

Revision as of 21:41, 11 July 2024

scientific article
Language Label Description Also known as
English
The Szemerédi-Trotter theorem in the complex plane
scientific article

    Statements

    The Szemerédi-Trotter theorem in the complex plane (English)
    0 references
    0 references
    3 May 2016
    0 references
    The main result of this paper is the following: There is a constant \(C\) such that \(n\) points and \(e\) lines in the complex Euclidean plane \(\mathbb{C}^{2}\) determine at most \(cn^{2/3}e^{2/3}+3n+3e\) point-line incidences and this upper bound is the best possible apart from constant factors. It generalizes the celebrated theorem by \textit{E. Szemerédi} and \textit{W. T. Trotter jun.} [Combinatorica 3, 381--392 (1983; Zbl 0541.05012)] about point-lines incidences in the real Euclidean plane \(\mathbb{R}^{2}\).
    0 references
    0 references
    Szemerédi-Trotter theorem
    0 references
    complex Euclidean plane
    0 references
    point-line incidences
    0 references
    \(d\)-dimensional affine subspace
    0 references
    Grassman manifold
    0 references
    complex linear transformation
    0 references
    separation lemma
    0 references
    covering lemma
    0 references

    Identifiers