Extremal problems in discrete geometry (Q794651): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56454601, #quickstatements; #temporary_batch_1706814575051
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q793744 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Horst Kramer / rank
Normal rank
 
Property / author
 
Property / author: Endre Szemerédi / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Horst Kramer / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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: Some Results on Triangular Operator Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3310509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial distinction between the Euclidean and projective planes / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02579194 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2166961358 / rank
 
Normal rank

Latest revision as of 10:39, 30 July 2024

scientific article
Language Label Description Also known as
English
Extremal problems in discrete geometry
scientific article

    Statements

    Extremal problems in discrete geometry (English)
    0 references
    0 references
    1983
    0 references
    The main result obtained by the authors of the paper under review is the following theorem: There exists a constant \(c_ 1\) so that if P is a set of n points and L is a family of t lines in the Euclidean plane, then the number of incidences between points in P and lines in L is at most \(c_ 1n^{2/3}t^{2/3}\) whenever \(\sqrt{n}\leq t\leq\left( \begin{matrix} n\\ 2\end{matrix} \right)\). Using this result the authors settle in the affirmative a conjecture of Erdős and Purdy by proving that there exists an absolute constant \(c_ 2\) such that if \(k\leq \sqrt{n}\), then the number of lines containing at least k points is less than \(c_ 2n^ 2/k^ 3\). The authors give also a partial solution to a conjecture of G. Dirac by proving the following result: There exists a constant \(c_ 3>0\) such that if P is a set of n points, not all on the same line, and L is the family of all lines determined by P, then there exists at least one point in P which belongs to more than \(c_ 3n\) lines from L. This last result was also obtained by \textit{J. Beck} [Combinatorica 3, 281-297 (1983; Zbl 0533.52004)].
    0 references
    configurations of points and lines
    0 references
    family of lines in the Euclidean plane
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references