Graphical distinct-realisation conjecture from the weak pinned distance conjecture
Statement
Let be a finite set in , and let be a finite, simple, connected graph. Write for the set of Euclidean distance measurements on the edges of arising from maps of into .
Graphical distinct-realisation conjecture. For every , there exists a positive constant , independent of , such that
The source says that Iosevich and Passant proved that the weak pinned distance conjecture implies this statement. The conjecture itself is not stated as resolved.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.