ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let K=FqK=\mathbb{F}_q be a finite field, let A1,…,AsA_1,\ldots,A_s be subsets of KK defining a projective nested cartesian set

X=[A1×⋯×As],\mathcal{X}=[A_1\times\cdots\times A_s],

and write di=∣Ai∣d_i=|A_i| for i=1,…,si=1,\ldots,s. Let CX(d)C_\mathcal{X}(d) be the corresponding dd-th projective nested cartesian code, and let δX(d,1)\delta_\mathcal{X}(d,1) denote its minimum distance. Carvalho–Lopez-Neumann–López's minimum-distance conjecture. The minimum distance is

δX(d,1)={(dk+2−ℓ+1)dk+3⋯dsif⁡d≤∑i=2s(di−1),1if⁡d≥∑i=2s(di−1)+1,\delta_\mathcal{X}(d,1)=\left\{\hspace{-1mm} \begin{array}{ll}\left(d_{k+2}-\ell+1\right)d_{k+3}\cdots d_s&\operatorname{if} d\leq \sum\limits_{i=2}^{s}\left(d_i-1\right),\\ \qquad \qquad 1&\operatorname{if} d\geq \sum\limits_{i=2}^{s}\left(d_i-1\right)+1, \end{array} \right.

where 0≤k≤s−20\leq k\leq s-2 and ℓ\ell are the unique integers such that

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

and 1≤ℓ≤dk+2−11\leq \ell\leq d_{k+2}-1. The statement was explicitly identified in the source as a conjecture, but the supplied material gives no resolution status; it is also immediately followed in the paper by a counterexample, so the status should be checked against that example.

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.