ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d≥2d\ge 2 and let C⊆2[n]\mathcal C\subseteq 2^{[n]} be a code. A pseudo-monomial is an element of the canonical form CF⁡(JC)\operatorname{CF}(J_\mathcal C) of the neural ideal JCJ_\mathcal C, and its degree is the number of factors in the pseudo-monomial.

Efficient degree computation conjecture. There is a polynomial-time algorithm that, given the codewords of C\mathcal C as binary vectors of length nn, determines whether every pseudo-monomial in CF⁡(JC)\operatorname{CF}(J_\mathcal C) has degree at most dd.

Efficiently computing the canonical form is relevant to the proposed algorithm for recognizing inductively pierced codes, since the algorithm begins by computing CF⁡(JC)\operatorname{CF}(J_\mathcal C). The supplied statement asserts the algorithm's existence but gives no resolution, so its status remains open.

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.