Heilbronn triangle problem in a square $H(7)$
The largest possible area of the smallest triangle formed by three of $7$ points in a unit square.
Value: ${\approx}0.0838590090$
lower bound
Checked construction
upper bound
Literature
History
Each bound that improved on the earlier ones, with the record of its discovery and its best evidence.
A bound is discovered in the literature, or by a certificate submitted here.
Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction).
Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature.
Submit a certificate.
| Date |
Bound |
Discovery |
Best evidence |
| 1972-05 |
$\ge {\approx}0.079$
|
M. Goldberg, Maximizing the smallest triangle made by N points in a square, Mathematics Magazine 45(3) (1972) 135-144.
|
Checked construction
via $\ge 0.08385900900$, heilbronn-square-7-lower-0p08385900900
|
| 1991 |
$\ge {\approx}0.083333$
|
L. Yang, J. Zhang and Z. Zeng, On Goldberg's conjecture: computing the first several Heilbronn numbers, Universität Bielefeld, Preprint 91-074 (1991).
[via F. Comellas and J.L.A. Yebra, New lower bounds for Heilbronn numbers, Electronic Journal of Combinatorics 9 (2002) #R6.]
|
Checked construction
via $\ge 0.08385900900$, heilbronn-square-7-lower-0p08385900900
|
| 2001-10-01 |
$\ge {\approx}0.0838590090$
|
F. Comellas and J.L.A. Yebra, New lower bounds for Heilbronn numbers, Electronic Journal of Combinatorics 9 (2002) #R6.
|
Checked construction
via $\ge 0.08385900900$, heilbronn-square-7-lower-0p08385900900
|
| 2011 |
$\le {\approx}0.0838590090$
|
Z. Zeng and L. Chen, On the Heilbronn optimal configuration of seven points in the square, in Automated Deduction in Geometry (ADG 2008), Lecture Notes in Artificial Intelligence 6301, Springer (2011) 196-224.
|
Literature
|