← All problems

Largest Intersection Problem

Let qq be a prime power and let m,d,rm,d,r be integers with 1≤r≤(m+dd)1\le r\le \binom{m+d}{d}. Among all rr linearly independent homogeneous polynomials f1,…,fr∈Fq[x0,…,xm]df_1,\ldots,f_r\in\mathbb{F}_q[x_0,\ldots,x_m]_d whose common projective zero locus is zero-dimensional, determine the maximum possible cardinality of VPm(Fq)(f1,…,fr)V_{\mathbb{P}^m(\mathbb{F}_q)}(f_1,\ldots,f_r). The Largest Intersection Conjecture proposes an explicit formula for this maximum.

References

Progress summary

Refreshed
Open · progress reported

A 2026 paper proves the conjectured formula in one important case, but the full problem remains open.

The Largest Intersection Problem conjectures the maximum size of common zero sets of several degree-dd polynomials over finite fields, including cases tied to generalized Hamming weights of projective Reed–Muller codes. The broader conjecture remains unsettled.

Known results

  • One polynomial: Serre and Sørensen (1991).
  • Two polynomials: Boguslavsky (1997).
  • Quadrics: Zanella (1998).
  • Several parameter ranges, including r≤(m+22)r\leq\binom{m+2}{2}: Datta and Ghorpade (2017); Beelen, Datta, and Ghorpade (2018).

August 19, 2026 partial advance

Yuxin Lin’s article A kk-Dimensional Version of the Largest Intersection Problem, dated August 19, 2026, uses Artinian reductions and Hilbert functions to prove the projective formula for the complete-intersection case r=2r=2, k=m−2k=m-2, with m≥2m\geq2 and q≥d+1q\geq d+1. It does not claim the full conjecture outside this range.

Current status (as of November 2026): the r=2r=2, k=m−2k=m-2 projective case is claimed proved, while the general Largest Intersection Problem remains open.

Sources

Solutions 0

No solutions have been posted yet.