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

计算多项式理想的二项式部分

Computing the Binomial Part of a Polynomial Ideal

Martin Kreuzer, Florian Walsh

AI总结:

本文给出计算任意多项式理想中二项式部分 Bin(I) 的完整算法,综合指数格、0维与仿射代数、饱和归约及胞腔分解,并在 SageMath 中实现。

摘要:

给定域 K 上多项式环 K[x_1,…,x_n] 中的一个理想 I,我们提出了一个完整算法,用于计算 I 的二项式部分,即由 I 中所有单项式和二项式生成的子理想 Bin(I)。该目标通过分步过程实现。首先,我们收集并扩展了若干用于在不同类型域中计算指数格的算法。随后,我们将其推广,以计算 0 维 K-代数中单位的指数格;在此过程中,必须把代数可分部分的计算推广到特征 p 的非完全域。接着,我们考察仿射 K-代数中单位格的计算,以及与其相关的特征标和格理想。这使我们能够在 I 关于未定元饱和时,通过将任务归约到 0 维情形来计算 Bin(I)。最后,我们通过计算一般理想的胞腔分解,并处理有限多个称为 (s,t)-二项式部分的特殊理想,来处理一般理想的 Bin(I) 计算。所有算法均已在 SageMath 中实现。

英文摘要:

Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This is achieved step-by-step. First we collect and extend several algorithms for computing exponent lattices in different kinds of fields. Then we generalize them to compute exponent lattices of units in 0-dimensional $K$-algebras, where we have to generalize the computation of the separable part of an algebra to non-perfect fields in characteristic $p$. Next we examine the computation of unit lattices in affine $K$-algebras, as well as their associated characters and lattice ideals. This allows us to calculate ${\rm Bin}(I)$ when $I$ is saturated with respect to the indeterminates by reducing the task to the 0-dimensional case. Finally, we treat the computation of ${\rm Bin}(I)$ for general ideals by computing their cellular decomposition and dealing with finitely many special ideals called $(s,t)$-binomial parts. All algorithms have been implemented in SageMath.

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

↑