ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let A0,…,AnA_0,\ldots,A_n be the sets defining a projective nested cartesian set X\mathcal{X}, and let di=∣Ai∣d_i=|A_i|. For an integer dd, write CX(d)C_{\mathcal{X}}(d) for the corresponding evaluation code and δX(d)\delta_{\mathcal{X}}(d) for its minimum distance. When 1≤d≤∑i=1n(di−1)1\leq d\leq\sum_{i=1}^{n}(d_i-1), let 0≤k≤n−10\leq k\leq n-1 and 0≤ℓ<dk+1−10\leq\ell<d_{k+1}-1 be the unique integers satisfying

d−1=∑i=1k(di−1)+ℓ.d-1=\sum_{i=1}^{k}(d_i-1)+\ell.

Minimum-distance conjecture. The minimum distance of CX(d)C_{\mathcal{X}}(d) is

δX(d)={(dk+1−ℓ)dk+2⋯dnif 1≤d≤∑i=1n(di−1),1if ∑i=1n(di−1)<d.\delta_{\mathcal{X}}(d)=\left\{\begin{array}{ll} (d_{k+1}-\ell)d_{k+2}\cdots d_n & \text{if } 1\leq d\leq\sum_{i=1}^{n}(d_i-1),\\ 1 & \text{if } \sum_{i=1}^{n}(d_i-1)<d. \end{array}\right.

The preceding lemma establishes this expression as an upper bound, while the conjecture asserts that the bound is attained. The value 11 beyond the indicated degree range is already obtained in the proof of the upper bound; the remaining issue is equality for the first range.

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.