关于仿射半正则多项式序列及相关 Gröbner 基的 Hilbert-Poincaré 级数
On Hilbert-Poincaré series of affine semi-regular polynomial sequences and related Gröbner bases
AI总结:
本文综述 Gröbner 基计算复杂度,并给出仿射半正则序列齐次化对应的截断 Hilbert-Poincaré 级数显式公式,为相关 Gröbner 基计算方法的正确性提供严格证明。
摘要:
如今,Gröbner 基是解决交换代数与代数几何中各类问题的核心工具。Gröbner 基的一个典型用途是多元多项式系统求解,这使我们能够构造针对后量子密码协议的代数攻击。因此,确定计算 Gröbner 基的复杂度在理论和实践上都非常重要:其中最重要的情形之一,是输入多项式构成一个(超定的)仿射半正则序列。本文第一部分旨在综述 Gröbner 基计算及其复杂度。在第二部分中,我们将给出与仿射半正则序列的齐次化相关的(截断)Hilbert-Poincaré 级数的显式公式。基于该公式,我们还研究由仿射半正则序列及其齐次化所生成理想的(约化)Gröbner 基。我们的部分结果被认为可为计算仿射半正则序列所生成理想的 Gröbner 基的方法的正确性提供数学上严格的证明。
英文摘要:
Gröbner bases are nowadays central tools for solving various problems in commutative algebra and algebraic geometry. A typical use of Gröbner bases is the multivariate polynomial system solving, which enables us to construct algebraic attacks against post-quantum cryptographic protocols. Therefore, the determination of the complexity of computing Gröbner bases is very important both in theory and in practice: One of the most important cases is the case where input polynomials compose an (overdetermined) affine semi-regular sequence. The first part of this paper aims to present a survey on Gröbner basis computation and its complexity. In the second part, we shall give an explicit formula on the (truncated) Hilbert-Poincaré series associated to the homogenization of an affine semi-regular sequence. Based on the formula, we also study (reduced) Gröbner bases of the ideals generated by an affine semi-regular sequence and its homogenization. Some of our results are considered to give mathematically rigorous proofs of the correctness of methods for computing Gröbner bases of the ideal generated by an affine semi-regular sequence.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。