Strict increase of maximal embedding dimensions with base set size
Statement
Let , and for a code write , , and for its open, closed, and non-degenerate embedding dimensions. For each , consider the maximum finite embedding dimension attained among codes on . Strict-increase conjecture. The maximum open embedding dimension is a strictly increasing function of : if and attain the respective maxima, then
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.