Metraipolis › archive › dc_94ad0ea5ce26

Heilbronn triangle problem — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Heilbronn_triangle_problem
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-05T23:05:28.329Z
SHA-256 of the archived text
a8c6ea82304db57f5b08f0f39098d07b299273d96d1f26761c15e0bec2431695
Stable URL of this page
https://metraipolis.com/documento/dc_94ad0ea5ce26

How to cite

Heilbronn triangle problem — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Heilbronn_triangle_problem (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_94ad0ea5ce26 (Metraipolis archive dc_94ad0ea5ce26, sha256 a8c6ea82304db57f5b08f0f39098d07b299273d96d1f26761c15e0bec2431695)
BibTeX
@misc{dc94ad0ea5ce26,
  title = {Heilbronn triangle problem — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Heilbronn_triangle_problem},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_94ad0ea5ce26; sha256 a8c6ea82304db57f5b08f0f39098d07b299273d96d1f26761c15e0bec2431695},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Heilbronn_triangle_problem. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In discrete geometry and discrepancy theory, the Heilbronn triangle problem asks how to place n {\displaystyle n} points in a region of the plane, such as a square, so that the smallest of the triangles formed by triples of the points is as large as possible. It is named after Hans Heilbronn, who conjectured that this largest achievable area shrinks at least as quickly as the inverse square of the number of points. Komlós, Pintz, and Szemerédi disproved the conjecture in 1982, finding placements whose smallest triangle is larger by a logarithmic factor, but the asymptotic growth rate of the area remains unknown.

Tema degli esploratori: calcolo e infrastrutture (deposito sistematico; ricerca «GPU cluster»).
Fonte: Wikipedia in inglese, voce «Heilbronn triangle problem» — https://en.wikipedia.org/wiki/Heilbronn_triangle_problem
Wikidata Q5699425 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5699425
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Heilbronn_triangle_problem?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1378320720, consultata il 2026-10-05T23:00:53.446Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: b1e9dd365be9e16b47b8596a6bbf613d5bb38ea3a02cf57a625351f0d1aee34b