ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be the Hilbert cube, with standard basis vectors eke_k, and set

α:=2π3.\alpha:=\frac{\sqrt{2}\pi}{3}.

Choose N⊆NN\subseteq\mathbb{N} such that

∑k∈N1k2=α−1,\sum_{k\in N}\frac{1}{k^2}=\alpha-1,

and define

s:=∑k=2∞1kek,t:=∑k∈N1kek.s:=\sum_{k=2}^\infty\frac{1}{k}e_k,\qquad t:=\sum_{k\in N}\frac{1}{k}e_k.

Hilbert-cube four-point conjecture. The set

{0,(1−12α)e1+s,e1+t,12αe1+s−t}\left\{0,\left(1-\frac{1}{2}\alpha\right)e_1+s,e_1+t,\frac{1}{2}\alpha e_1+s-t\right\}

is an optimal code in the Hilbert cube. Numerical experiments on truncations motivate this prediction; the supplied text later confirms that such choices of NN exist but notes that the resulting codes are not unique.

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 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.