ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let er(d,m;q)e_r(d,m;q) denote the maximum number of Fq\mathbb{F}_q-rational points in the common zero set of an rr-dimensional subspace of degree-dd homogeneous polynomials in Fq[x0,dots,xm]\mathbb{F}_q[x_0,dots,x_m]. Let Hj(d−1,m−l+1;q)H_j(d-1,m-l+1;q) and pim−l(q)pi_{m-l}(q) be defined as in the preceding notation. Suppose m,d,rm,d,r are positive integers satisfying 1≤r≤(m+dd)1\leq r\leq \binom{m+d}{d}. Choose the unique 1≤l≤m+11\leq l\leq m+1 such that

(m+dd)−(m+d+1−ld)<r≤(m+dd)−(m+d−ld).\binom{m+d}{d}-\binom{m+d+1-l}{d}<r\leq\binom{m+d}{d}-\binom{m+d-l}{d}.

Set j=r−(m+dd)+(m+d+1−ld)j=r-\binom{m+d}{d}+\binom{m+d+1-l}{d}, so 0<j≤(m+d−ld−1)0<j\leq\binom{m+d-l}{d-1}. Beelen-Datta-Ghorpade conjecture. For q≥d+1q\geq d+1,

er(d,m;q)=Hj(d−1,m−l+1;q)+πm−l(q).e_r(d,m;q)=H_j(d-1,m-l+1;q)+\pi_{m-l}(q).

This conjecture gives an exact formula for the generalized Hamming weights of projective Reed-Muller codes; the source proves it in the case m=2m=2, while the general statement 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.