Largest Intersection Problem
Let be a prime power and let be integers with . Among all linearly independent homogeneous polynomials whose common projective zero locus is zero-dimensional, determine the maximum possible cardinality of . The Largest Intersection Conjecture proposes an explicit formula for this maximum.
References
- Artinian reduction applied to the Largest Intersection Problem — arXiv — Yuxin Lin
Source: arXiv
Progress summary
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- 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 : Datta and Ghorpade (2017); Beelen, Datta, and Ghorpade (2018).
August 19, 2026 partial advance
Yuxin Lin’s article A -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 , , with and . It does not claim the full conjecture outside this range.
Current status (as of November 2026): the , projective case is claimed proved, while the general Largest Intersection Problem remains open.
Sources
Solutions 0
No solutions have been posted yet.