Prime planar integral point sets containing any prescribed distance

Let M(2,n)\mathfrak{M}(2,n) denote planar integral point sets with nn points. An integral point set is prime when it cannot be obtained by scaling a smaller integral point set while preserving its power and structure. Prime-set distance conjecture. For every n3n\geq 3 and d1d\geq 1, there exists a prime set MM(2,n)M\in\mathfrak{M}(2,n) containing points M1M_1 and M2M_2 whose distance is exactly dd. The source presents this as the final and apparently most approachable conjecture; it follows earlier constructive results in higher dimensions but is not proved in the supplied text.

Sources & referencesView supporting material

Primary source

Nikolai Avdeev, “On existence of integral point sets and their diameter bounds”, arXiv:1906.11926 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.