ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk and ll be integers at least 22 of opposite parity, with k≥2l+1k\geq 2l+1 if kk is odd and k≥2l−2k\geq 2l-2 if kk is even, and set

d=12(3k+l+1).d=\frac{1}{2}(3k+l+1).

Here S(d,k,k+l)S(d,k,k+l) denotes the maximum length of a circuit code with parameters (d,k,k+l)(d,k,k+l), and K(d,k)K(d,k) denotes the relevant upper-bound quantity for circuit-code lengths.

Maximum-length conjecture. Under these conditions,

S(d,k,k+l)=K(d,k).S(d,k,k+l)=K(d,k).

This strengthens the previously recalled conjecture for odd kk and even ll, extending the predicted equality to opposite-parity pairs satisfying the stated bounds. The equality is confirmed in several cases, including l=2l=2 or 44 with odd kk, and the result for l=3l=3 with even kk in the cited theorems; the general assertion 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.