On the minimum distance determined by \(n(\leq 7)\) points in an isoscele right triangle (Q2565207): Difference between revisions

Let \(R\) be a convex region in the Euclidean plane \(\mathbb{R}^2\), \(C\) a configuration (finite set) of \(n\) \((\in\mathbb{N})\) points in \(R\), \(m(C)\) the minimum distance between pairs of points of \(C\), and \[ f_R(n):=\max_{|C|=n}m(C). \] Denote by \(S\) a unit square and by \(T\) a unit isoscele right (-angled) triangle. In this paper, the exact values of \(f_T(n)\) for \(2\leq n \leq 7\) and the corresponding configurations are given. The cases \(n=2,3,4,5,6\) can be solved easily, and from known results one gets: \(f_T(2)=f_S(2)\), \(f_T(3)=f_S(4)\), \(f_T(4)=f_S(5)\), \(f_T(5)=f_S(7)\), \(f_T(6)=f_S(9)\). In the case \(n=7\) (which requires a longer reasoning) the best configuration can be shown to be just half of the configuration for the best known bound of \(f_S(10)\), corresponding to \(f_T(7)=(4+w)(\text{sqr}(1+2w)-w)/7\approx 0.4195\), where \(\text{sqr}:=\) square root and \(w:=\text{sqr}(2)\).