Dice Question Streamline Icon: https://streamlinehq.com

Exact formula for Δk′(α(k−1)) for 4 ≤ k and α ≤ k−1

Prove that for integers k ≥ 4 and α ≤ k−1, Δk′(α(k−1)) = 1/(2(α−1)), where Δk′(n) denotes the supremum, over all n-point sets placed in any unit-area rectangle of the form [0,d] × [0,d^{-1}] with 0 < d ≤ 1, of the minimum area of the convex hull of any k points from the set.

Information Square Streamline Icon: https://streamlinehq.com

Background

For general k-gons, the authors extend their method and provide upper bounds of the form (k−2)/n + o(1/n). They observe a lower bound construction for certain n obtained by placing points at the corners of an α × (k−1) grid, which guarantees Δk′(α(k−1)) ≥ 1/(2(α−1)).

They conjecture that this lower bound is tight for all α ≤ k−1, which would imply that the grid placement is optimal and, in turn, yield an improved global upper bound of approximately k/(2n) for Δk(n).

References

One can prove that $\Delta_{k}'(\alpha(k-1)) \geq \dfrac{1}{2(\alpha-1)}$ by placing the points in the corners of a $\alpha \times (k-1)$ grid. We conjecture that this is, in fact, the optimal placement.

Improved upper bounds for the Heilbronn's Problem for $k$-gons (2405.12945 - Gajjala et al., 21 May 2024) in Conjecture (labelled Conjecture gen_conjecture), Section “Convex k-gons: Proof of Theorem 2”