arXiv · 2611.01273
Artinian reduction applied to the Largest Intersection Problem
Abstract
Suppose we have $r$ hypersurfaces in $\mathbb{P}^m$ of degree $d$, whose defining polynomials are linearly independent and whose intersection is zero-dimensional. What is the maximum number of points in their intersection? This problem is motivated by computing the generalized Hamming weights of projective Reed-Muller codes, and a conjectured formula for this maximum was given in [21]. We prove the conjectured formula for arbitrary $m$ when $\binom{m+d}{d}-\binom{d+2}{2}<r\leq\binom{m+d}{d}$. We use the notion of Artinian reduction to reformulate the problem in terms of graded Artinian algebras and then apply combinatorial tools to bound their Hilbert functions.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yuxin Lin. 2026-10-31. Artinian reduction applied to the Largest Intersection Problem. https://arxiv.org/abs/2611.01273
Cite the original work for its findings. Save a collection to share your selection of sources.