1 paper · 1 filter
Lucas Wang
Let g(k) be the maximum size of a planar set that determines at most k distances. We prove 3C(Λhex)π klogk(1+o(1))≤g(k)≤Cklogk, so $g(k) \…