arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.4384math.AGcs.MScs.SCmath.ACmath.CO
收藏

可计算Hilbert格式

Computable Hilbert Schemes

Paolo Lella

摘要:

在这篇博士论文中,我们提出了一个算法的方法来研究希尔伯特计划。发展了算法方法,得到了Hilbert格式的一般结果.在第一章中,我们讨论了定义的希尔伯特计划作为一个合适的格拉斯曼子计划的方程,并在第五章中,我们确定了一个新的方程组的程度低于迄今已知的方程的程度。在第2章中,我们研究了用于投影算法技术的最重要的对象,即Borel固定理想。我们确定了一个算法,计算所有的饱和Borel固定理想与Hilbert多项式分配,我们研究了它们的组合性质。在第三章中,我们给出了Borel-不动理想的一种新的平坦变形,从而给出了Hilbert格式连通性的一个新的证明。在第四章中,我们构造了理想族,推广了关于固定项序共享同一初始理想的理想族的概念。其中一些族对应于Hilbert格式的开子集,可用于Hilbert格式的局部研究。第六章研究了射影三维空间中局部Cohen-Macaulay曲线的Hilbert格式的连通性问题。我们表明,一个被认为是“好”的候选人是非连接的希尔伯特计划,而不是连接。此外,还有三个附录,介绍和解释如何使用所提出的算法的实现。

英文摘要:

In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert scheme as subscheme of a suitable Grassmannian and in Chapter 5 we determine a new set of equations of degree lower than the degree of equations known so far. In Chapter 2 we study the most important objects used to project algorithmic techniques, namely Borel-fixed ideals. We determine an algorithm computing all the saturated Borel-fixed ideals with Hilbert polynomial assigned and we investigate their combinatorial properties. In Chapter 3 we show a new type of flat deformations of Borel-fixed ideals which lead us to give a new proof of the connectedness of the Hilbert scheme. In Chapter 4 we construct families of ideals that generalize the notion of family of ideals sharing the same initial ideal with respect to a fixed term ordering. Some of these families correspond to open subsets of the Hilbert scheme and can be used to a local study of the Hilbert scheme. In Chapter 6 we deal with the problem of the connectedness of the Hilbert scheme of locally Cohen-Macaulay curves in the projective 3-space. We show that one of the Hilbert scheme considered a "good" candidate to be non-connected, is instead connected. Moreover there are three appendices that present and explain how to use the implementations of the algorithms proposed.

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

↑