arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.3018math.COmath.AG
收藏

有限域组合几何中的Hilbert函数与有限次Zapriki闭包

Hilbert Functions and the Finite Degree Zariski Closure in Finite Field Combinatorial Geometry

Zipei Nie, Anthony Y. Wang

摘要:

近年来,多项式方法在组合几何中得到了许多令人瞩目的结果。本文利用仿射Hilbert函数得到了有限域几何中的一个估计定理。陈述定理最自然的方式是通过一种有界次数的Zagliki闭包运算:给定一个集合,我们考虑在该集合上某个有界次数为零的所有多项式,然后考虑这些多项式的公共零点。例如,一条直线上d + 1个点的d次闭包将包含整条直线,因为任何在d + 1个点上为零的d次多项式在这条直线上必定为零。我们的结果是一个有限度封闭的大小上的一个给定的集合。最后,我们调整我们使用的希尔伯特函数的方法的多重性。

英文摘要:

The polynomial method has been used recently to obtain many striking results in combinatorial geometry. In this paper, we use affine Hilbert functions to obtain an estimation theorem in finite field geometry. The most natural way to state the theorem is via a sort of bounded degree Zariski closure operation: given a set, we consider all polynomials of some bounded degree vanishing on that set, and then the common zeros of these polynomials. For example, the degree d closure of d + 1 points on a line will contain the whole line, as any polynomial of degree at most d vanishing on the d + 1 points must vanish on the line. Our result is a bound on the size of a finite degree closure of a given set. Finally, we adapt our use of Hilbert functions to the method of multiplicities.

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

↑