Small triangles

From MaRDI portal





The article surveys the Heilbronn triangle problem, a classical question in discrete geometry, in the following formulation: what is the smallest value $\Delta$ such that any set of $N$ points in a unit square necessarily contains a triangle with an area $S\leq\Delta$? \N\NIt provides a clear historical development of the problem up to modern results and improvements. The author explores the persistent gap between lower bounds established by semi-random methods and the evolution of upper bounds, detailing the transition from classical density increment strategies and Riesz energy to modern analytic approaches. \N\NParticular attention is given to the latest advancements in projection theory and harmonic analysis, which have led to the current best upper bound of $\Delta(N)\lesssim N^{-7/6+o(1)}$. Finally, the article includes a comprehensive table demonstrating the historical progression of these estimates, offering a valuable reference for researchers in the field.











This page was built for publication: Small triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6845292)