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

计算重数序列

Computing multiplicity sequences

Justin Chen, Youngsu Kim, Jonathan Montaño

AI总结:

本文介绍了Macaulay2的MultiplicitySequence包,用于计算分次理想的重数序列及相关不变量,并讨论了基于二元Hilbert多项式和一般元素技术的两种计算策略。

摘要:

Macaulay2的MultiplicitySequence包计算域上标准分次环中分次理想的重数序列,以及与整依赖相关的单项式理想的几个不变量。我们讨论了计算重数序列的两种实现策略:一种通过二元Hilbert多项式,另一种通过一般元素技术。

英文摘要:

The MultiplicitySequence package for Macaulay2 computes the multiplicity sequence of a graded ideal in a standard graded ring over a field, as well as several invariants of monomial ideals related to integral dependence. We discuss two strategies implemented for computing multiplicity sequences: one via the bivariate Hilbert polynomial, and the other via the technique of general elements.

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

↑