Unique distancing: oscarcunningham.com/670/unique

How many points can you place in an \(n\times n\) grid so that all pairwise distances are distinct? The linked post concerns whether \(n\) points are possible (no for all but finitely many cases because there are too many pairs and too few sums of squares) but it also looks interesting to maximize the number of points.

@domotorp Thanks — a comment there led to the relevant paper arxiv.org/abs/1211.1776 — its bounds are far from tight but I didn't see any improvements in later work citing it.

Sign in to participate in the conversation

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!