ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let fd(n)f_d(n) be minimal such that, in any set of nn points in Rd\mathbb{R}^d, there exist at most fd(n)f_d(n) pairs of points which distance 11 apart. Estimate fd(n)f_d(n).

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.