arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0311129math.AGcs.ITmath.ACmath.IT
收藏

Cayley-Bacharach与完全交的求值码

Cayley-Bacharach and evaluation codes on complete intersections

Leah Gold, John Little, Hal Schenck

摘要:

在最近的工作中,J. Hansen使用上同调方法找到了由射影平面中的约化完全相交所确定的求值码的最小距离的下界。本文将Hansen的结果从P^2推广到P^m,并证明了Hansen工作中的假设可以被削弱.证明是简洁的,并结合凯莱-Bacharach定理和界的评价代码从减少零计划。

英文摘要:

In recent work, J. Hansen uses cohomological methods to find a lower bound for the minimum distance of an evaluation code determined by a reduced complete intersection in the projective plane. In this paper, we generalize Hansen's results from P^2 to P^m; we also show that the hypotheses in Hansen's work may be weakened. The proof is succinct and follows by combining the Cayley-Bacharach theorem and bounds on evaluation codes obtained from reduced zero-schemes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑