arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.03577cs.SC
收藏

混合Gr{<$}bner基算法:多齐次稀疏情形

Towards Mixed Gr{ö}bner Basis Algorithms: the Multihomogeneous and Sparse Case

Matías Bender, Jean-Charles Faugère, Elias Tsigaridas

摘要:

计算代数中最大的开放问题之一是设计有效的Gr{<$}bner基计算算法,该算法考虑了输入多项式的稀疏性。我们可以在非混合多项式系统的情况下执行这样的计算,即具有相同支持的多项式的系统,使用Faug{è}re,Spaenlehauer和Svartz [ISSAC'14]的方法。我们提出了两个算法的稀疏Gr{<$}bner基计算的混合系统。第一种方法利用混合稀疏系统进行计算,并利用多项式的支持。在正则性假设下,它不执行归零。对于混合,平方和0维多齐次多项式系统,我们提出了一个专用的,可能更有效的,算法,利用不同的代数属性,不执行减少到零。我们给出了计算中出现的最大度的显式界。

英文摘要:

One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{ö}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of unmixed polynomial systems, that is systems with polynomials having the same support, using the approach of Faug{è}re, Spaenlehauer, and Svartz [ISSAC'14]. We present two algorithms for sparse Gr{ö}bner bases computations for mixed systems. The first one computes with mixed sparse systems and exploits the supports of the polynomials. Under regularity assumptions, it performs no reductions to zero. For mixed, square, and 0-dimensional multihomogeneous polynomial systems, we present a dedicated, and potentially more efficient, algorithm that exploits different algebraic properties that performs no reduction to zero. We give an explicit bound for the maximal degree appearing in the computations.

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

↑