ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(q,3)f(q,3) denote the maximum length nn for which a (q,3,n)(q,3,n)-Armstrong code exists. Sali's conjecture. For all q≥2q\geq 2,

f(q,3)=3q−2.f(q,3)=3q-2.

The construction from orthogonal double covers gives the lower bound f(q,3)≥3q−2f(q,3)\geq 3q-2, and the conjecture asserts that this bound is always tight. It is false.

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.