ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let [n]={1,…,n}[n]=\{1,\ldots,n\}, and for a code C⊆2[n]\mathcal C\subseteq 2^{[n]} write odim⁡(C)\operatorname{odim}(\mathcal C), cdim⁡(C)\operatorname{cdim}(\mathcal C), and ndim⁡(C)\operatorname{ndim}(\mathcal C) for its open, closed, and non-degenerate embedding dimensions. For each nn, consider the maximum finite embedding dimension attained among codes on [n][n]. Strict-increase conjecture. The maximum open embedding dimension is a strictly increasing function of nn: if C⊆2[n]\mathcal C\subseteq 2^{[n]} and D⊆2[n+1]\mathcal D\subseteq 2^{[n+1]} attain the respective maxima, then

odim⁡(D)>odim⁡(C).\operatorname{odim}(\mathcal D)>\operatorname{odim}(\mathcal C).

The analogous strict increase should hold for closed and non-degenerate embedding dimensions. This would describe how efficiently neural codes on larger base sets can realize high-dimensional structures; the paper does not establish the conjecture, and the corresponding maxima remain a subject for further study.

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.