计算$\Q$上Groebner基的概率和确定性模算法
A probabilistic and deterministic modular algorithm for computing Groebner basis over $\Q$
摘要:
模算法在计算机代数系统中得到了广泛的应用,例如可以有效地计算多元多项式的gcd。已知可以在$\Q$上计算Groebner基,但在CAS实现者中似乎并不流行。在本文中,我将展示如何检查候选Groebner基础(通过重建几个Groebner基础模不同的素数)与给定的错误概率,这可能是0,如果认证的Groebner基础是必要的。这个算法现在是Giac/Xcas计算机代数系统使用的默认算法,具有竞争性的时间,这要归功于一个技巧,一旦计算完成模另一个素数,就可以加速计算Groebner基模素数。
英文摘要:
Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among CAS implementers. In this paper, I will show how to check a candidate Groebner basis (obtained by reconstruction of several Groebner basis modulo distinct prime numbers) with a given error probability, that may be 0 if a certified Groebner basis is desired. This algorithm is now the default algorithm used by the Giac/Xcas computer algebra system with competitive timings, thanks to a trick that can accelerate computing Groebner basis modulo a prime once the computation has been done modulo another prime.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。