ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A⊂R2A\subset \mathbb{R}^2 be a set of size nn and let {d1,…,dk}\{d_1,\ldots,d_k\} be the set of distinct distances determined by AA. Let f(d)f(d) be the number of times the distance dd is determined, and suppose the did_i are ordered such that f(d1)≥f(d2)≥⋯≥f(dk).f(d_1)\geq f(d_2)\geq \cdots \geq f(d_k). Estimate max⁡(f(d1)−f(d2)),\max (f(d_1)-f(d_2)), where the maximum is taken over all AA of size nn.

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.