Conjectured improved upper bound for the Heilbronn triangle problem

From papers

Let ΔH(n)\Delta_{\mathrm H}(n) denote the largest possible minimum area of a triangle determined by nn points in the unit square. Improved Heilbronn bound conjecture. There exists an absolute constant c>0c>0 such that

ΔH(n)n7/6c.\Delta_{\mathrm H}(n)\lesssim n^{-7/6-c}.

This would improve the known upper bound ΔH(n)n7/6+o(1)\Delta_{\mathrm H}(n)\le n^{-7/6+o(1)} and reflects the expectation that the sharp 2/32/3 exponent for the minimal point–line distance problem does not settle the Heilbronn triangle problem.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Cosmin Pohoata, “The sharp exponent for the minimal distance problem”, arXiv:2607.20422 (2026).

Solutions 0

No solutions have been posted yet.