ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a point set PP in Rd\mathbb{R}^d, let fd(P)f_d(P) be the number of unit-distance point pairs: fd(P)=∣{(u,v)∣u,v∈P, ∥u−v∥=1}∣  ;f_d(P) = \left| \{ (u,v) \mid u, v \in P, \, \|u-v\| = 1 \} \right| \;; and let fd(n)f_d(n) be the maximum over all sets of nn points: fd(n)=max⁡∣P∣=nfd(P)  .f_d(n) = \max_{|P| = n} f_d(P) \;. Further, let gd(P)g_d(P) denote the number of distinct distances induced by a set of points PP: gd(P)=∣{∥u−v∥∣u,v∈P}∣  ;g_d(P) = \left| \{ \|u-v\| \mid u, v \in P \} \right| \;; and let gd(n)g_d(n) be the minimum over all sets of nn points: gd(n)=min⁡∣P∣=ngd(P)  .g_d(n) = \min_{|P|=n} g_d(P) \;. Give upper and lower bounds on fd(n)f_d(n) and gd(n)g_d(n), particularly for d=2d=2 and d=3d=3.

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.