The sharp exponent for the minimal distance problem — mentioned by arutar

Sun, 04 Oct 2026 18:04:53 GMT

Maybe here are the easiest ones to state: 1. One can ask the same problem but for k-gons instead of triangles. 2. Given a set of point-line pairs (x1, l1), ..., (xn, ln) [[that is, each xj lies in the line lj]], consider the smallest distance between some xi and lj where i != j. Then as in Heilbronn's problem we want configurations so that this smallest distance is as large as possible. In 2 here we already see a key feature of 'incidence lower bounds' problems: we need to assume some initial 'trivial incidences' for the problem to make sense at all. If we didn't require them; we could put…

Paper and discussion history. A mention is not an endorsement.

The sharp exponent for the minimal distance problem · HackerPapers discussions

The sharp exponent for the minimal distance problem — mentioned by arutar