REVIEW 2 cited by
A new upper bound for the Heilbronn triangle problem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
For sufficiently large $n$, we show that in every configuration of $n$ points chosen inside the unit square there exists a triangle of area less than $n^{-8/7-1/2000}$. This improves upon a result of Koml\'os, Pintz and Szemer\'edi from 1982. Our approach establishes new connections between the Heilbronn triangle problem and various themes in incidence geometry and projection theory which are closely related to the discretized sum-product phenomenon.
Forward citations
Cited by 2 Pith papers
-
The sharp exponent for the minimal distance problem
The minimal distance problem has sharp exponent 2/3: lower-bound configurations of size n with separation n^{-2/3−o(1)} are constructed via trace-zero lattices in high-degree totally real number fields.
-
Furstenberg set theorem for transversal families of functions
A sharp dimension bound for Furstenberg sets built from transversal families of graphs, with an application to Fourier decay of fractal measures on convex curves.
Discussion (0). Continue with ORCID to comment.