arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.07098math.AC
收藏

行列式与Gröbner基的通用故事

A universal tale of determinants and Gröbner bases

Aldo Conca

AI总结:

本文回顾了Gröbner基从定义到成为多项式符号计算与理想簇研究核心工具的发展历程,聚焦行列式理想的通用Gröbner基的发现过程,以及Bernd Sturmfels及其合作者的关键贡献。

摘要:

1965年,Buchberger定义了Gröbner基(格罗布纳基)以及一种计算它们的算法。尽管起步缓慢,到了20世纪80年代,Gröbner基已成为多项式符号计算的主要工具,同时也是通过所谓的Gröbner形变技术研究理想与簇的理论工具。由行列式定义的环和代数簇是交换代数、代数几何和不变量理论中最经典的研究对象之一。到20世纪80年代末,计算行列式理想的Gröbner基的时机已经成熟。我们将讲述行列式理想的(通用)Gröbner基是如何被发现的,以及Bernd Sturmfels及其合作者在这项工作中发挥的关键作用。

英文摘要:

In 1965 Buchberger defined Gröbner bases and an algorithm to compute them. Despite a slow start, already in the eighties Gröbner bases had become the main device for symbolic computations involving polynomials as well as a theoretical tool for the investigation of ideals and varieties via the so-called Gröbner deformation techniques. Rings and algebraic varieties defined by means of determinants are among the most classical objects in commutative algebra, algebraic geometry and invariant theory. By the end of the the eighties the time was ripe for the computation of Gröbner bases of determinantal ideals. We will tell the tale of how (universal) Gröbner bases of determinantal ideals were identified and the key role played by Bernd Sturmfels and his collaborators in this enterprise.

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

↑