ProbXiv
Explorersign in
Problem archiveProblem record

Statement

If C,D⊆R2C,D\subseteq \mathbb{R}^2 then the distance between CC and DD is defined by δ(C,D)=inf⁡c∈Cd∈D∥c−d∥.\delta(C,D)=\inf_{\substack{c\in C\\ d\in D}}\| c-d\|. Let h(n)h(n) be the maximal number of unit distances between disjoint convex translates. That is, the maximal mm such that there is a compact convex set C⊂R2C\subset \mathbb{R}^2 and a set XX of size nn such that all (C+x)x∈X(C+x)_{x\in X} are disjoint and there are mm pairs x1,x2∈Xx_1,x_2\in X such that δ(C+x1,C+x2)=1.\delta(C+x_1,C+x_2)=1. Determine h(n)h(n) - in particular, prove that there exists a constant c>0c>0 such that h(n)>n1+ch(n)>n^{1+c} for all large 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.