ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let C\mathcal{C} be a neural code, meaning a collection of subsets of a neuron set, and call a codeword maximal if it is not properly contained in another codeword. A code is convex if it can be realized as the code of a collection of convex open sets in Euclidean space. A local obstruction and a wheel are the combinatorial obstructions described in the source.

Jeffs's conjecture. If C\mathcal{C} has up to four maximal codewords, then C\mathcal{C} is convex if and only if C\mathcal{C} has no local obstructions and no wheels.

This conjecture extends the known characterization for codes with at most six neurons and four maximal codewords, where convexity is equivalent to avoiding local obstructions and wheels. Its status is not specified in the source.

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.