加载中…
Suppose we have hypersurfaces in of degree , whose defining polynomials are linearly independent, and their intersection has dimension . Then what is the largest possible intersection of the hypersurfaces? We conjecture an exact formula for this problem and prove it when . We show that this can be used to compute the generalized hamming weights of the projective Reed-Muller code and hence settle a conjecture of Beelen, Datta and Ghorpade for .

生成讲解博客的中文版本

生成AI智能校验的中文版本