Maximum planar sets that determine \(k\) distances (Q1126289): Difference between revisions

The authors identify subsets of points in the plane with the property that there are \(k\) interpoint distances and have as many points as possible. They do this for \(k\leq 5\). They conjecture that such maximal point set for \(k\geq 7\) must be subsets of the triangular lattice.