Boguslavsky–Tsfasman conjecture for projective point counts over finite fields

From papers

Let S(m)=Fq[x0,,xm]S(m)=\mathbb{F}_q[x_0,\dots,x_m], and let Sd(m)S_d(m) be its degree-dd graded component. For m,d1m,d\geq 1 and 1r(m+dd)1\leq r\leq \binom{m+d}{d}, let er(d,m)e_r(d,m) be the maximum number of Fq\mathbb{F}_q-rational points of a projective algebraic set defined by rr linearly independent homogeneous polynomials of degree dd in m+1m+1 variables. Let Ω(d,m)\Omega(d,m) be the set of (m+1)(m+1)-tuples of nonnegative integers summing to dd, and let wr(d,m)=(β1,,βm+1)w_r(d,m)=(\beta_1,\dots,\beta_{m+1}) be the tuple specified in the conjecture, with l=min{iβi0}l=\min\{i\mid \beta_i\neq 0\}. Write πj=1+q++qj\pi_j=1+q+\cdots+q^j for j0j\geq 0, and set π1=0\pi_{-1}=0. Boguslavsky–Tsfasman conjecture. If qd+1q\geq d+1, then

er(d,m)=i=lmβi(πmiπmil)+πm2l.e_r(d,m)=\sum_{i=l}^{m}\beta_i\bigl(\pi_{m-i}-\pi_{m-i-l}\bigr)+\pi_{m-2l}.

The conjecture proposes an exact projective analogue of the known affine formula of Heijnen and Pellikaan for generalized Reed–Muller codes. Its status is not resolved by the supplied text.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Deepesh Singhal and Yuxin Lin, “On a conjecture of Beelen, Datta and Ghorpade for the number of points of varieties over finite fields”, arXiv:2311.07702 (2025).

Solutions 0

No solutions have been posted yet.